Complexity of Finding Graph Roots with Girth Conditions.
Resource URI: http://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/FarzadLLT12
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/FarzadLLT12
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Babak_Farzad
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Lap_Chi_Lau
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Nguyen_Ngoc_Tuy
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Van_Bang_Le
>
foaf:
homepage
<
http://dx.doi.org/10.1007%2Fs00453-010-9442-9
>
foaf:
homepage
<
http://dx.doi.org/10.1007/s00453-010-9442-9
>
dc:
identifier
DBLP journals/algorithmica/FarzadLLT12
(xsd:string)
dc:
identifier
DOI 10.1007%2Fs00453-010-9442-9
(xsd:string)
dcterms:
issued
2012
(xsd:gYear)
swrc:
journal
<
http://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Complexity of Finding Graph Roots with Girth Conditions.
(xsd:string)
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Babak_Farzad
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Lap_Chi_Lau
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Nguyen_Ngoc_Tuy
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Van_Bang_Le
>
swrc:
number
1-2
(xsd:string)
swrc:
pages
38-53
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/FarzadLLT12/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/FarzadLLT12
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica62.html#FarzadLLT12
>
rdfs:
seeAlso
<
http://dx.doi.org/10.1007/s00453-010-9442-9
>
dc:
title
Complexity of Finding Graph Roots with Girth Conditions.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
62
(xsd:string)