Constructive Linear Time Algorithms for Branchwidth

13 years 9 months ago

Download www.cs.uu.nl

We prove that, for any ﬁxed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width.

Hans L. Bodlaender, Dimitrios M. Thilikos

Real-time Traffic

Branch Decomposition | ICALP 1997 | Linear Time Algorithm | Programming Languages |

claim paper

» Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time

» Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS

» Linear Time Suffix Array Construction Using DCritical Substrings

» Tableaubased automata construction for dynamic linear time temporal logic

» Accurate Construction of Consensus Genetic Maps via Integer Linear Programming

» Linear Suffix Array Construction by Almost Pure InducedSorting

» A Very Fast Linear Time Distributed Algorithm on General Graphs for the MinimumWeight Span...

» NearLinear Time Construction of Sparse Neighborhood Covers

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	ICALP
Authors	Hans L. Bodlaender, Dimitrios M. Thilikos

Comments (0)

Sciweavers

Constructive Linear Time Algorithms for Branchwidth

Branch Decomposition | ICALP 1997 | Linear Time Algorithm | Programming Languages |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers