[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/Frank90>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Andr%E2%88%9A%C2%B0s_Frank>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FFSCS.1990.89593>
foaf:homepage <https://doi.org/10.1109/FSCS.1990.89593>
dc:identifier DBLP conf/focs/Frank90 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FFSCS.1990.89593 (xsd:string)
dcterms:issued 1990 (xsd:gYear)
rdfs:label Augmenting Graphs to Meet Edge-Connectivity Requirements (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Andr%E2%88%9A%C2%B0s_Frank>
swrc:pages 708-718 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS31b>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/Frank90/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/Frank90>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs90.html#Frank90>
rdfs:seeAlso <https://doi.org/10.1109/FSCS.1990.89593>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject node costs, time complexity, edge-connectivity, minimum number, min-max formula, polynomial-time algorithm, minimum-cost augmentation problem, polynomial time, edge costs (xsd:string)
dc:title Augmenting Graphs to Meet Edge-Connectivity Requirements (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document