Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.05426MaRDI QIDQ5897571FDOQ5897571

Authors: Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Computing branchwidth via efficient triangulations and blocks
• Algorithms – ESA 2005
• Branchwidth of chordal graphs
• Computing the branchwidth of interval graphs
• Automata, Languages and Programming

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited In (7)

• Algorithms – ESA 2005
• Constructive linear time algorithms for branchwidth
• Fast FPT-approximation of branchwidth
• Branchwidth of chordal graphs
• Computing branchwidth via efficient triangulations and blocks
• Computing rank-width exactly
• Linear Branch Entropy: Characterizing and Optimizing Branch Behavior in a Micro-Architecture Independent Way

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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