scientific article; zbMATH DE number 1262810

MaRDI QIDQ4232801zbMATH OpenFDO

Authors Elias Dahlhaus

Publication date 18 May 2000

zbMATH Keywords

weak bipolarizable graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing the treewidth and the minimum fill-in with the modular decomposition
• Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
• Graph-Theoretic Concepts in Computer Science
• Exact Algorithms for Treewidth and Minimum Fill-In
• scientific article; zbMATH DE number 1304320

Cited in

(6)

• Computing the treewidth and the minimum fill-in with the modular decomposition
• Fill-in and operations of graphs
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
• Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
• scientific article; zbMATH DE number 5059933 (Why is no real title available?)
• Graph-Theoretic Concepts in Computer Science

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4232801)