A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/sofsem/BabenkoKR10
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/sofsem/BabenkoKR10
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ignat_I._Kolesnichenko
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ilya_P._Razenshteyn
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Maxim_A._Babenko
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-11266-9%5F14
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-11266-9_14
>
dc:
identifier
DBLP conf/sofsem/BabenkoKR10
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-11266-9%5F14
(xsd:string)
dcterms:
issued
2010
(xsd:gYear)
rdfs:
label
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ignat_I._Kolesnichenko
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ilya_P._Razenshteyn
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Maxim_A._Babenko
>
swrc:
pages
165-175
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/sofsem/2010
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/sofsem/BabenkoKR10/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/sofsem/BabenkoKR10
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/sofsem/sofsem2010.html#BabenkoKR10
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-11266-9_14
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/sofsem
>
dc:
title
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document