Optimal Numberings of an $N \times N$ Array
- 1 October 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (4) , 571-582
- https://doi.org/10.1137/0607063
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Brain Mechanisms of VisionScientific American, 1979
- The NP-Completeness of the bandwidth minimization problemComputing, 1976
- Minimization of mean-square error for data transmitted via group codesIEEE Transactions on Information Theory, 1969
- A necessary condition on minimal cube numberingsJournal of Applied Probability, 1967
- Optimal numberings and isoperimetric problems on graphsJournal of Combinatorial Theory, 1966
- Assignment of Numbers to VerticesThe American Mathematical Monthly, 1964
- Optimal Assignments of Numbers to VerticesJournal of the Society for Industrial and Applied Mathematics, 1964