Bandwidth of the complete \(k\)-ary tree

DOI10.1016/0012-365X(93)E0219-TzbMath0827.05050WikidataQ127098633 ScholiaQ127098633MaRDI QIDQ1896357

Lawren Smithline

Publication date: 27 August 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bandwidthcomplete \(k\)-ary treealgorithm of Chung

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

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

• Unnamed Item