Abstract
Previous article Next article Optimal Assignments of Numbers to VerticesL. H. HarperL. H. Harperhttps://doi.org/10.1137/0112012PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] William H. Kautz, Optimized data encoding for digital computers, Convention Record of the I. R. E., 2 (1954), 47–57 MR0078064 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Edge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi FunctionsVsevolod F. Lev22 December 2015 | SIAM Journal on Discrete Mathematics, Vol. 29, No. 4AbstractPDF (349 KB)Extractors for Circuit SourcesEmanuele Viola29 April 2014 | SIAM Journal on Computing, Vol. 43, No. 2AbstractPDF (271 KB)k-Robust Single-Message TransmissionAndré Kündgen, Michael J. Pelsmajer, and Radhika Ramamurthi31 March 2010 | SIAM Journal on Discrete Mathematics, Vol. 24, No. 1AbstractPDF (327 KB)Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite ProgrammingHans Mittelmann and Jiming Peng2 December 2010 | SIAM Journal on Optimization, Vol. 20, No. 6AbstractPDF (251 KB)Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming GraphsM. Cemil Azizouglu and Ömer Eugeciouglu1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 17, No. 2AbstractPDF (402 KB)Edge-Bandwidth of GraphsTao Jiang, Dhruv Mubayi, Aditya Shastri, and Douglas B. West1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 12, No. 3AbstractPDF (282 KB)Optimal Numberings of an $N \times N$ ArrayGraeme Mitchison and Richard Durbin17 July 2006 | SIAM Journal on Algebraic Discrete Methods, Vol. 7, No. 4AbstractPDF (1219 KB)Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on TreesThomas Lengauer31 July 2006 | SIAM Journal on Algebraic Discrete Methods, Vol. 3, No. 1AbstractPDF (1346 KB)Complexity Results for Bandwidth MinimizationM. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 34, No. 3AbstractPDF (2269 KB)Maximally Connected Arrays on the n-CubeA. J. Bernstein17 February 2012 | SIAM Journal on Applied Mathematics, Vol. 15, No. 6AbstractPDF (424 KB)Optimal Binary Coding of Ordered NumbersK. Steiglitz and A. J. Bernstein13 July 2006 | Journal of the Society for Industrial and Applied Mathematics, Vol. 13, No. 2AbstractPDF (246 KB) Volume 12, Issue 1| 1964Journal of the Society for Industrial and Applied Mathematics History Submitted:12 February 1963Published online:13 July 2006 InformationCopyright © 1964 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0112012Article page range:pp. 131-135ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Society for Industrial and Applied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
