A Linear Algorithm for Topological Bandwidth in Degree-Three Trees

DOI10.1137/0217064MaRDI QIDQ3813314zbMATH OpenOpenAlexFDO

Authors Z. Miller

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

zbMATH Keywords

topological bandwidth

Mathematics Subject Classification ID

Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3914372
• On the Cutwidth and the Topological Bandwidth of a Tree
• scientific article; zbMATH DE number 4173000
• On upper bounds of bandwidths of trees
• Parameterized complexity of bandwidth on trees
• Approximation algorithms for the bandwidth minimization problem for a large class of trees
• scientific article; zbMATH DE number 3857138
• Linear rank-width and linear clique-width of trees
• Linear rank-width and linear clique-width of trees
• scientific article; zbMATH DE number 4134066

Cited in

(11)

• Helicopter search problems, bandwidth and pathwidth
• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
• On the bandwidth of the Kneser graph
• scientific article; zbMATH DE number 3858434 (Why is no real title available?)
• On the Cutwidth and the Topological Bandwidth of a Tree
• scientific article; zbMATH DE number 3914372 (Why is no real title available?)
• Topological Bandwidth
• scientific article; zbMATH DE number 4047762 (Why is no real title available?)
• Bandwidth of trees of diameter at most 4
• The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
• A polynomial algorithm for recognizing bounded cutwidth in hypergraphs

This page was built for publication: A Linear Algorithm for Topological Bandwidth in Degree-Three Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813314)