A survey of graph layout problems
ACM Computing Surveys (CSUR)
Profile minimization on triangulated triangles
Discrete Mathematics
On the profile of the corona of two graphs
Information Processing Letters
Graph minimum linear arrangement by multilevel weighted edge contractions
Journal of Algorithms
On the edge-bandwidth of graph products
Theoretical Computer Science
An extremal graph with given bandwidth
Theoretical Computer Science
Theoretical Computer Science
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
Computers and Operations Research
Multilevel algorithms for linear ordering problems
Journal of Experimental Algorithmics (JEA)
The profile of the Cartesian product of graphs
Discrete Applied Mathematics
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Exact wirelength of hypercubes on a grid
Discrete Applied Mathematics
Note: On explicit formulas for bandwidth and antibandwidth of hypercubes
Discrete Applied Mathematics
Two models of two-dimensional bandwidth problems
Information Processing Letters
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
Discrete Applied Mathematics
Multiscale approach for the network compression-friendly ordering
Journal of Discrete Algorithms
Wirelength of 1-fault hamiltonian graphs into wheels and fans
Information Processing Letters
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
Discrete Applied Mathematics
A refined evaluation function for the MinLA problem
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Embedding of hypercubes into necklace, windmill and snake graphs
Information Processing Letters
Wirelength of hypercubes into certain trees
Discrete Applied Mathematics
An optimal time algorithm for minimum linear arrangement of chord graphs
Information Sciences: an International Journal
Embeddings of circulant networks
Journal of Combinatorial Optimization
Note: Bandwidth of the product of paths of the same length
Discrete Applied Mathematics
| Hi-index | 0.00 |
This article provides a survey of results on the exact bandwidth, edgesum, and profile of graphs. A bibliography of work in these areas is provided. The emphasis is on composite graphs. This may be regarded as an update of the original survey of solved bandwidth problems by Chinn, Chvátalová, Dewdney, and Gibbs [10] in 1982. Also several of the application areas involving these graph parameters are described. © John & Sons, Inc. Graph Theory 31: 75–94, 1999