Constructive linear time algorithms for branchwidth
From MaRDI portal
Publication:4571992
DOI10.1007/3-540-63165-8_217zbMath1401.05277MaRDI QIDQ4571992
Hans L. Bodlaender, Dimitrios M. Thilikos
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/18903
Related Items
Branch decompositions and minor containment, Graphs, branchwidth, and tangles! Oh my!, Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time, Testing branch-width, Branchwidth of chordal graphs, Derivation of algorithms for cutwidth and related graph layout parameters, Computing the branchwidth of interval graphs, Branch-width, parse trees, and monadic second-order logic for matroids., Unnamed Item, A Local Search Algorithm for Branchwidth