A linear time algorithm for finding tree-decompositions of small treewidth.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/stoc/Bodlaender93
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Bodlaender93
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hans_L._Bodlaender
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F167088.167161
>
foaf:
homepage
<
https://doi.org/10.1145/167088.167161
>
dc:
identifier
DBLP conf/stoc/Bodlaender93
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F167088.167161
(xsd:string)
dcterms:
issued
1993
(xsd:gYear)
rdfs:
label
A linear time algorithm for finding tree-decompositions of small treewidth.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hans_L._Bodlaender
>
swrc:
pages
226-234
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/stoc/STOC25
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/icdt/ChekuriR97
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/pods/KolaitisV98
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/pods/Vardi00
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/stoc/Bodlaender93/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/stoc/Bodlaender93
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/stoc/stoc1993.html#Bodlaender93
>
rdfs:
seeAlso
<
https://doi.org/10.1145/167088.167161
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/stoc
>
dc:
subject
graph algorithms, graph minors, partial k-trees, pathwidth, treewidth
(xsd:string)
dc:
title
A linear time algorithm for finding tree-decompositions of small treewidth.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document