Computing Tree-Depth Faster Than 2n.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/FominGP15
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/FominGP15
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Archontia_C._Giannopoulou
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Fedor_V._Fomin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michal_Pilipczuk
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00453-014-9914-4
>
foaf:
homepage
<
https://doi.org/10.1007/s00453-014-9914-4
>
dc:
identifier
DBLP journals/algorithmica/FominGP15
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00453-014-9914-4
(xsd:string)
dcterms:
issued
2015
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Computing Tree-Depth Faster Than 2n.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Archontia_C._Giannopoulou
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Fedor_V._Fomin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michal_Pilipczuk
>
swrc:
number
1
(xsd:string)
swrc:
pages
202-216
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/FominGP15/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/FominGP15
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica73.html#FominGP15
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00453-014-9914-4
>
dc:
title
Computing Tree-Depth Faster Than 2n.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
73
(xsd:string)