Computing Vertex Connectivity: New Bounds from Old Techniques.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/HenzingerRG96
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/HenzingerRG96
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Harold_N._Gabow
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Monika_Rauch_Henzinger
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Satish_Rao
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1996.548505
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1996.548505
>
dc:
identifier
DBLP conf/focs/HenzingerRG96
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1996.548505
(xsd:string)
dcterms:
issued
1996
(xsd:gYear)
rdfs:
label
Computing Vertex Connectivity: New Bounds from Old Techniques.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Harold_N._Gabow
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Monika_Rauch_Henzinger
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Satish_Rao
>
swrc:
pages
462-471
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/1996
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/HenzingerRG96/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/HenzingerRG96
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs96.html#HenzingerRG96
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1996.548505
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
computational geometry; vertex connectivity; smallest number of vertices; deterministic algorithm; digraph; error probability; preflow push algorithm
(xsd:string)
dc:
title
Computing Vertex Connectivity: New Bounds from Old Techniques.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document