scientific article; zbMATH DE number 4215390

MaRDI QIDQ3361907zbMATH OpenFDO

Authors Manfred Wiegers

Publication date 1990

zbMATH Keywords

arrangement problemsembedding problemsk-section problemlayout problems

Mathematics Subject Classification ID

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

Recommendations

• On minimum bisection and related partition problems in graphs with bounded tree width
• A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
• scientific article; zbMATH DE number 4131663
• scientific article; zbMATH DE number 3866594
• Linear time algorithms for NP-hard problems restricted to partial k- trees

Cited in

(6)

• A partial k-arboretum of graphs with bounded treewidth
• Treewidth of the generalized Kneser graphs
• On the parameterized complexity of computing balanced partitions in graphs
• The treewidth of 2-section of hypergraphs
• scientific article; zbMATH DE number 2245640 (Why is no real title available?)
• Equitable connected partition and structural parameters revisited: N-fold beats Lenstra

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 Q3361907)