Bandwidth of the complete \(k\)-ary tree
From MaRDI portal
Publication:1896357
DOI10.1016/0012-365X(93)E0219-TzbMath0827.05050WikidataQ127098633 ScholiaQ127098633MaRDI QIDQ1896357
Publication date: 27 August 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
New results on edge-bandwidth ⋮ On semidefinite programming bounds for graph bandwidth ⋮ Tabu search for the cyclic bandwidth problem ⋮ Lower bounds for the bandwidth problem ⋮ Complexity and Algorithms for Well-Structured k-SAT Instances ⋮ Bandwidth of the composition of two graphs. ⋮ An improved simulated annealing algorithm for bandwidth minimization ⋮ Bandwidth of the strong product of two connected graphs ⋮ Lower bounds on treespan ⋮ Bandwidth and density for block graphs
Cites Work