A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jgaa/LevitinKMZ06
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jgaa/LevitinKMZ06
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Lev_B._Levitin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Lev_Zakrevski
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mark_G._Karpovsky
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mehmet_Mustafa
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.7155%2Fjgaa.00134
>
foaf:
homepage
<
https://doi.org/10.7155/jgaa.00134
>
dc:
identifier
DBLP journals/jgaa/LevitinKMZ06
(xsd:string)
dc:
identifier
DOI doi.org%2F10.7155%2Fjgaa.00134
(xsd:string)
dcterms:
issued
2006
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jgaa
>
rdfs:
label
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Lev_B._Levitin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Lev_Zakrevski
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mark_G._Karpovsky
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mehmet_Mustafa
>
swrc:
number
2
(xsd:string)
swrc:
pages
387-420
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jgaa/LevitinKMZ06/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jgaa/LevitinKMZ06
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jgaa/jgaa10.html#LevitinKMZ06
>
rdfs:
seeAlso
<
https://doi.org/10.7155/jgaa.00134
>
dc:
title
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
10
(xsd:string)