Lattice bandwidth of random graphs

DOI10.1016/0166-218X(91)90046-YzbMath0733.05070OpenAlexW2131972252MaRDI QIDQ810061

Zevi Miller, Colin J. H. McDiarmid

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90046-y

zbMATH Keywords

random graphsgraph labellingBernoulli graphslattice bandwidth

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Spanning subgraphs of random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• The complexity of minimizing wire lengths in VLSI layouts
• On the Bandwidth of Random Graphs
• NP-completeness for minimizing maximum edge length in grid embeddings
• On the Probable Performance of Heuristics for Bandwidth Minimization
• Achromatic numbers of random graphs
• Complexity Results for Bandwidth Minimization
• Bounds on the costs of data encodings
• The chromatic number of random graphs

This page was built for publication: Lattice bandwidth of random graphs