Bandwidths and profiles of trees

DOI10.1016/0095-8956(87)90052-9zbMath0588.05015OpenAlexW1995937439MaRDI QIDQ1073038

Herbert S. Wilf, Andrew M. Odlyzko

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90052-9

zbMATH Keywords

treebandwidthwidthNP-completePerron-Frobenius

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (2)

Profile minimization on compositions of graphs ⋮ The shape of unlabeled rooted random trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average height of binary trees and other simple trees
• The NP-completeness of the bandwidth minimization problem
• Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
• Complexity Results for Bandwidth Minimization
• On the Altitude of Nodes in Random Trees
• On the height of trees
• On the Distribution of the Number of Vertices in Strata of a Random Tree
• A remark on a problem of Harary

This page was built for publication: Bandwidths and profiles of trees