scientific article

From MaRDI portal

Revision as of 14:10, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3796771

Jump to:navigation, search

zbMath0651.68079MaRDI QIDQ3796771

Hans L. Bodlaender

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-complete chromatic index polynomial time graph isomorphism tree-decompositions partial k-trees graphs with small treewidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Canonical representations of partial 2-and 3-trees ⋮ The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues ⋮ NC-algorithms for graphs with small treewidth ⋮ On minimum dominating sets with minimum intersection ⋮ Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families ⋮ Canonical representations of partial 2- and 3-trees ⋮ On the complexity of finding iso- and other morphisms for partial \(k\)- trees

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3796771&oldid=17366240"