Optimal Numberings of an N \times N Array

DOI10.1137/0607063MaRDI QIDQ4726293zbMATH OpenOpenAlexFDO

Authors 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

edgesumfractal mappinggraph numbering

Mathematics Subject Classification ID

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

Recommendations

• Optimal Binary Coding of Ordered Numbers
• Optimal linear arrangement of a rectangular grid
• On lower bounds for numbered complete graphs
• scientific article; zbMATH DE number 15358
• Vertex ordering and partitioning problems for random spatial graphs.

Cites work

• A necessary condition on minimal cube numberings
• Assignment of Numbers to Vertices
• scientific article; zbMATH DE number 3630808 (Why is no real title available?)
• Minimization of mean-square error for data transmitted via group codes
• Optimal Assignments of Numbers to Vertices
• Optimal numberings and isoperimetric problems on graphs
• Some simplified NP-complete graph problems
• The NP-completeness of the bandwidth minimization problem

Cited in

(25)

• Parameterized algorithmics for linear arrangement problems
• Locality and bounding-box quality of two-dimensional space-filling curves
• On a problem of Kleitman and West
• Examining the volume efficiency of the cortical architecture in a multi- processor network model
• Formation of field discontinuities and islands in visual cortical maps
• Towards optimal locality in mesh-indexings
• On minimum cuts and the linear arrangement problem
• Improved exact approaches for row layout problems with departments of equal length
• Layout of random circulant graphs
• Vertex ordering and partitioning problems for random spatial graphs.
• On bandwidth and edgesum for the composition of two graphs
• Optimal linear arrangement of a rectangular grid
• Node set optimization problem for complete Josephus cubes
• Minimum linear arrangement of chord graphs
• Lower bounds for the minimum linear arrangement of a graph
• A generalization of Edgesum problem
• On a binary distance model for the minimum linear arrangement problem
• An optimal time algorithm for minimum linear arrangement of chord graphs
• Towards optimal locality in mesh-indexings
• Minimum linear arrangement of the Cartesian product of optimal order graph and path
• Experiments on the minimum linear arrangement problem
• Optimal Binary Coding of Ordered Numbers
• Multi-armed bandit for the cyclic minimum sitting arrangement problem
• A probabilistic algorithm for optimal linear arrangements
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726293)