Optimal Assignments of Numbers to Vertices
From MaRDI portal
Publication:5627967
DOI10.1137/0112012zbMath0222.94004MaRDI QIDQ5627967
Publication date: 1964
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0112012
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B05: Linear codes (general theory)
Related Items
Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$, On bandwidth, cutwidth, and quotient graphs, Optimal Numberings of an $N \times N$ Array, Evaluation of Boolean functions on noisy input, Edge-Isoperimetric Inequalities and Influences, Experiments on the minimum linear arrangement problem, Unnamed Item, Polytopes, graphs, and complexes, Sets of Lattice Points which Contain a Maximal Number of Edges, LINEAR LAYOUT OF GENERALIZED HYPERCUBES, Optimal arrangement of data in a tree directory, On edge numberings of the \(n\)-cube graph, On optimal linear arrangements of trees, Dense sets and embedding binary trees into hypercubes, Isoperimetric inequalities for faces of the cube and the grid, Exact face-isoperimetric inequalities, Cleaning a network with brushes, Molecular solution to the optimal linear arrangement problem based on DNA computation, On randomized broadcasting in star graphs, The profile of the Cartesian product of graphs, Data encodings and their costs, The global theory of paths in networks. I: Definitions, examples and limits, Edge-isoperimetric inequalities in the grid, Contributions to the geometry of Hamming spaces, The cyclic cutwidth of trees, On an equivalence in discrete extremal problems, A finite-dimensional normed space with two non-equivalent symmetric bases, Matchings and paths in the cube, On \(k\)-ary \(n\)-cubes: Theory and applications., The edge-isoperimetric problem on the 600-vertex regular solid, Recursive circulants and their embeddings among hypercubes, A new lower bound for the bipartite crossing number with applications, The bandwidth sum of join and composition of graphs, On the area of hypercube layouts., Edge-isoperimetric problems for Cartesian powers of regular graphs, Generating lower bounds for the linear arrangement problem, Edge isoperimetric theorems for integer point arrays, On bandwidth and edgesum for the composition of two graphs, On bandwidth sums of graphs, Lower bounds for the quadratic assignment problem via triangle decompositions, An improved simulated annealing algorithm for bandwidth minimization, A study on cyclic bandwidth sum, An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem, The carvingwidth of hypercubes, Minimum linear arrangement of chord graphs, The optimal number of faces in cubical complexes, On Kruskal's cascades and counting containments in a set of subsets, Edge Addition Number of Cartesian Product of Paths and Cycles, A New Lower Bound for the Minimum Linear Arrangement of a Graph, Isoperimetric Problem and Meta-fibonacci Sequences, Storage representations for tree-like data structures, Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees, Bounds on the costs of data encodings
