Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/BodlaenderR03
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/BodlaenderR03
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hans_L._Bodlaender
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Udi_Rotics
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00453-003-1026-5
>
foaf:
homepage
<
https://doi.org/10.1007/s00453-003-1026-5
>
dc:
identifier
DBLP journals/algorithmica/BodlaenderR03
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00453-003-1026-5
(xsd:string)
dcterms:
issued
2003
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hans_L._Bodlaender
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Udi_Rotics
>
swrc:
number
4
(xsd:string)
swrc:
pages
375-408
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/BodlaenderR03/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/BodlaenderR03
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica36.html#BodlaenderR03
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00453-003-1026-5
>
dc:
subject
Treewidth, Minimum fill-in, Modular decomposition, Minimal separators, Polynomial algorithms, Graph algorithms.
(xsd:string)
dc:
title
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
36
(xsd:string)