Algorithms – ESA 2005
From MaRDI portal
Publication:5475848
DOI10.1007/11561071zbMath1162.68503OpenAlexW2501059503MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Tangle bases: Revisited ⋮ Mixed Search Number and Linear-Width of Interval and Split Graphs ⋮ Branchwidth of chordal graphs ⋮ Computing branchwidth via efficient triangulations and blocks ⋮ Mixed search number and linear-width of interval and split graphs ⋮ Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches ⋮ Tree-length equals branch-length ⋮ Edge-maximal graphs of branchwidth k
This page was built for publication: Algorithms – ESA 2005
