Optimal Numberings of an $N \times N$ Array

DOI10.1137/0607063zbMath0617.05059OpenAlexW1495595412MaRDI QIDQ4726293

Graeme Mitchison, Richard Durbin

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0607063

zbMATH Keywords

graph numberingedgesumfractal mapping

Mathematics Subject Classification ID

Graph theory (05C99) Designs and configurations (05B99)

Related Items (20)

Vertex ordering and partitioning problems for random spatial graphs. ⋮ Towards optimal locality in mesh-indexings ⋮ On bandwidth and edgesum for the composition of two graphs ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ On a problem of Kleitman and West ⋮ An optimal time algorithm for minimum linear arrangement of chord graphs ⋮ Unnamed Item ⋮ Towards optimal locality in mesh-indexings ⋮ Node set optimization problem for complete Josephus cubes ⋮ Layout of random circulant graphs ⋮ A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem ⋮ Parameterized algorithmics for linear arrangement problems ⋮ Minimum linear arrangement of chord graphs ⋮ Experiments on the minimum linear arrangement problem ⋮ On minimum cuts and the linear arrangement problem ⋮ Locality and bounding-box quality of two-dimensional space-filling curves ⋮ Examining the volume efficiency of the cortical architecture in a multi- processor network model ⋮ Formation of field discontinuities and islands in visual cortical maps

Cites Work

• Unnamed Item
• The NP-completeness of the bandwidth minimization problem
• Some simplified NP-complete graph problems
• Assignment of Numbers to Vertices
• Optimal numberings and isoperimetric problems on graphs
• Minimization of mean-square error for data transmitted via group codes
• A necessary condition on minimal cube numberings
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Optimal Numberings of an $N \times N$ Array