[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/NagamochiNI00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Nagamochi>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/S._Nakamura>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Toshihide_Ibaraki>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs004539910004>
foaf:homepage <https://doi.org/10.1007/s004539910004>
dc:identifier DBLP journals/algorithmica/NagamochiNI00 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs004539910004 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/algorithmica>
rdfs:label A Simplified √ē(nm) Time Edge-Splitting Algorithm in Undirected Graphs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Nagamochi>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/S._Nakamura>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Toshihide_Ibaraki>
swrc:number 1 (xsd:string)
swrc:pages 50-67 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/NagamochiNI00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/algorithmica/NagamochiNI00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica26.html#NagamochiNI00>
rdfs:seeAlso <https://doi.org/10.1007/s004539910004>
dc:subject Undirected graph, Multigraph, Edge-connectivity, Edge splitting, Minimum cut, Polynomial algorithm, Deterministic algorithm. (xsd:string)
dc:title A Simplified √ē(nm) Time Edge-Splitting Algorithm in Undirected Graphs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 26 (xsd:string)