Iterated rounding algorithms for the smallest k-edge connected spanning subgraph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/soda/GabowG08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/soda/GabowG08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Harold_N._Gabow
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Suzanne_Gallagher
>
foaf:
homepage
<
http://dl.acm.org/citation.cfm?id=1347082.1347143
>
dc:
identifier
DBLP conf/soda/GabowG08
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Harold_N._Gabow
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Suzanne_Gallagher
>
swrc:
pages
550-559
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/soda/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/soda/GabowG08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/soda/GabowG08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/soda/soda2008.html#GabowG08
>
rdfs:
seeAlso
<
http://dl.acm.org/citation.cfm?id=1347082.1347143
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/soda
>
dc:
title
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document