Optimal Assignments of Numbers to Vertices
From MaRDI portal
Publication:5627967
DOI10.1137/0112012zbMath0222.94004OpenAlexW2063054346MaRDI 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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items
Three conjectures of Ostrander on digraph Laplacian eigenvectors, Minimum Linear Arrangement of Series-Parallel Graphs, Edge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi Functions, Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$, Polytopes, graphs, and complexes, Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path, Pull-push method: a new approach to edge-isoperimetric problems, Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems, The maximum linear arrangement problem for trees under projectivity and planarity, A New Lower Bound for the Minimum Linear Arrangement of a Graph, Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees, Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes, Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions, On linear layout of bicube and construction of optimal incomplete bicube, Maximum subgraph problem for 3-regular Knödel graphs and its wirelength, Boolean functions with small second-order influences on the discrete cube, Isoperimetric Problem and Meta-fibonacci Sequences, Minimum Linear Arrangement of Generalized Sierpinski Graphs, Linear layouts of generalized hypercubes, Reflect-push methods. Part I: Two dimensional techniques, KKL's influence on me, The Proofs of Two Directed Paths Conjectures of Bollobás and Leader, Optimal Embedding of Locally Twisted Cubes into Grids, Strong contraction and influences in tail spaces, Sets of Lattice Points which Contain a Maximal Number of Edges, LINEAR LAYOUT OF GENERALIZED HYPERCUBES, On bandwidth, cutwidth, and quotient graphs, Almost Isoperimetric Subsets of the Discrete Cube, A note on minimum linear arrangement for BC graphs, LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY, Isoperimetry in integer lattices, On the structure of subsets of the discrete cube with small edge boundary, The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions, Unnamed Item, On Kruskal's cascades and counting containments in a set of subsets, Optimal arrangement of data in a tree directory, Unnamed Item, Edge-Isoperimetric Inequalities and Influences, Storage representations for tree-like data structures, SDP Relaxations for Some Combinatorial Optimization Problems, Experiments on the minimum linear arrangement problem, Unnamed Item, Bounds on the costs of data encodings, Optimal Numberings of an $N \times N$ Array, Unnamed Item, Evaluation of Boolean functions on noisy input, THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS, Common Information, Noise Stability, and Their Extensions, Edge Addition Number of Cartesian Product of Paths and Cycles, Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees, Log-Sobolev inequality for the multislice, with applications, Edge isoperimetric inequalities for powers of the hypercube, Planar lattice subsets with minimal vertex boundary, Increasing paths in edge-ordered graphs: the hypercube and random graph, A finite-dimensional normed space with two non-equivalent symmetric bases, Edge-isoperimetric problems for Cartesian powers of regular graphs, Alternative evaluation functions for the cyclic bandwidth sum problem, On the runtime and robustness of randomized broadcasting, An isoperimetric inequality for conjugation-invariant sets in the symmetric group, 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, Norms of randomized circulant matrices, The \(S\)-\textsc{labeling} problem: an algorithmic tour, Tabu search for the cyclic bandwidth problem, Improved exact approaches for row layout problems with departments of equal length, Matchings and paths in the cube, Quantum query complexity of almost all functions with fixed on-set size, Minimum degree conditions for the strength and bandwidth of graphs, Lower bounds for the quadratic assignment problem via triangle decompositions, Semidefinite relaxations of ordering problems, Dense sets and embedding binary trees into hypercubes, Lower bounds for the bandwidth problem, New relationships for multi-neighborhood search for the minimum linear arrangement problem, A branch-and-bound algorithm for the minimum cut linear arrangement problem, Compact representation of graphs with bounded bandwidth or treedepth, Optimal embedding of hypercube into cylinder, On the number of hypercubic bipartitions of an integer, An approximate vertex-isoperimetric inequality for \(r\)-sets, Demand-aware network designs of bounded degree, Data encodings and their costs, Decorous combinatorial lower bounds for row layout problems, A stability result for the cube edge isoperimetric inequality, Summarizing transactional databases with overlapped hyperrectangles, A rigorous proof on circular wirelength for hypercubes, On \(k\)-ary \(n\)-cubes: Theory and applications., The edge-isoperimetric problem on the 600-vertex regular solid, Shadows of ordered graphs, Preface: CALDAM 2017, A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout, The single row facility layout problem: state of the art, Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry, Chvátal's conjecture and correlation inequalities, New infinite family of regular edge-isoperimetric graphs, Morphisms for resistive electrical networks, Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses, Long paths and cycles in subgraphs of the cube, Isoperimetric inequalities for faces of the cube and the grid, Exact face-isoperimetric inequalities, On a biased edge isoperimetric inequality for the discrete cube, On a binary distance model for the minimum linear arrangement problem, The global theory of paths in networks. I: Definitions, examples and limits, Long geodesics in subgraphs of the cube, Cleaning a network with brushes, Edge-isoperimetric inequalities in the grid, Molecular solution to the optimal linear arrangement problem based on DNA computation, An optimal time algorithm for minimum linear arrangement of chord graphs, An improved simulated annealing algorithm for bandwidth minimization, Eigenvalues of subgraphs of the cube, An isoperimetric inequality for antipodal subsets of the discrete cube, A study on cyclic bandwidth sum, Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees, A quasi-stability result for dictatorships in \(S_n\), On edge numberings of the \(n\)-cube graph, A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs, Bounded-depth circuits cannot sample good codes, An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem, Linear time construction of a compressed Gray code, Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs, The bandwidth sum of join and composition of graphs, Bandwidth sums of block graphs and cacti, The inverse Banzhaf problem, The carving-width of generalized hypercubes, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, Node set optimization problem for complete Josephus cubes, Contributions to the geometry of Hamming spaces, The carvingwidth of hypercubes, A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem, On randomized broadcasting in star graphs, The profile of the Cartesian product of graphs, Minimum linear arrangement of chord graphs, Bounds on isoperimetric values of trees, Vertex-isoperimetric stability in the hypercube, Characterization of the congestion lemma on layout computation, The cyclic cutwidth of trees, On density of subgraphs of halved cubes, The optimal number of faces in cubical complexes, Embedding algorithm of spined cube into grid structure and its wirelength computation, Edge-isoperimetric inequalities and ball-noise stability: linear programming and probabilistic approaches, Recursive circulants and their embeddings among hypercubes, A new lower bound for the bipartite crossing number with applications, Spanning tree congestion of the hypercube, On optimal linear arrangements of trees, The distance orientation problem, On an equivalence in discrete extremal problems, On the area of hypercube layouts., Expansion in supercritical random subgraphs of the hypercube and its consequences, Conjectures on wirelength of hypercube into cylinder and torus, The filling problem in the cube
