Optimal Numberings of an N \times N Array
From MaRDI portal
DOI10.1137/0607063zbMATH Open0617.05059OpenAlexW1495595412MaRDI QIDQ4726293FDOQ4726293
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
Recommendations
Cites Work
- Optimal Assignments of Numbers to Vertices
- Some simplified NP-complete graph problems
- Optimal numberings and isoperimetric problems on graphs
- The NP-completeness of the bandwidth minimization problem
- Assignment of Numbers to Vertices
- A necessary condition on minimal cube numberings
- Title not available (Why is that?)
- Minimization of mean-square error for data transmitted via group codes
Cited In (23)
- Node set optimization problem for complete Josephus cubes
- Minimum linear arrangement of chord graphs
- On a problem of Kleitman and West
- Locality and bounding-box quality of two-dimensional space-filling curves
- Vertex ordering and partitioning problems for random spatial graphs.
- On bandwidth and edgesum for the composition of two graphs
- Towards optimal locality in mesh-indexings
- Optimal Binary Coding of Ordered Numbers
- Minimum linear arrangement of the Cartesian product of optimal order graph and path
- A generalization of Edgesum problem
- Improved exact approaches for row layout problems with departments of equal length
- 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
- Layout of random circulant graphs
- Formation of field discontinuities and islands in visual cortical maps
- Parameterized algorithmics for linear arrangement problems
- Experiments on the minimum linear arrangement problem
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- On minimum cuts and the linear arrangement problem
- Optimal linear arrangement of a rectangular grid
- Lower bounds for the minimum linear arrangement of a graph
- Examining the volume efficiency of the cortical architecture in a multi- processor network model
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)
