Algorithms – ESA 2005
From MaRDI portal
Publication:5475848
DOI10.1007/11561071zbMath1162.68503MaRDI QIDQ5475848
Jan Arne Telle, Christophe Paul
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Branchwidth of chordal graphs, Computing branchwidth via efficient triangulations and blocks, Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches, Tree-length equals branch-length, Mixed search number and linear-width of interval and split graphs, Edge-maximal graphs of branchwidth k, Mixed Search Number and Linear-Width of Interval and Split Graphs