A Linear Algorithm for Topological Bandwidth in Degree-Three Trees
From MaRDI portal
Publication:3813314
DOI10.1137/0217064zbMath0662.68072OpenAlexW2020032392MaRDI QIDQ3813314
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0217064
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)
Related Items
Helicopter search problems, bandwidth and pathwidth, Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications, A polynomial algorithm for recognizing bounded cutwidth in hypergraphs, On the bandwidth of the Kneser graph