From edge decomposition formulae to composition algorithms

MaRDI QIDQ5301766zbMATH OpenFDO

Authors André Pönitz

Publication date 20 January 2009

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Faster computation of path-width
• scientific article; zbMATH DE number 4173000
• A simple linear-time algorithm for finding path-decompositions of small width
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Algorithms finding tree-decompositions of graphs

Cited in

(1)

• Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs

This page was built for publication: From edge decomposition formulae to composition algorithms

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