scientific article; zbMATH DE number 2060183

Publication date: 17 March 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

stabilization compression isoperimetric problems morphisms.

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items

Edge isoperimetric inequalities for powers of the hypercube, Planar lattice subsets with minimal vertex boundary, A problem of Shapozenko on Johnson graphs, Embedding complete multi-partite graphs into Cartesian product of paths and cycles, Wiener index via wirelength of an embedding, Edge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi Functions, Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees, A quantitative Gobbard-Satterthwaite theorem without neutrality, The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\), Embeddings of circulant networks, An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength, Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path, Simple polytopes without small separators, Wirelength of embedding complete multipartite graphs into certain graphs, Layout of embedding locally twisted cube into the extended theta mesh topology, Isoperimetry, stability, and irredundance in direct products, Embedding Circulant Networks into Butterfly and Benes Networks, Tiling-based models of perimeter and area, The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals, Optimal embedding of hypercube into cylinder, Pull-push method: a new approach to edge-isoperimetric problems, A rigorous proof on circular wirelength for hypercubes, On the bandwidth of a Hamming graph, Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, An extremal graph problem on a grid and an isoperimetric problem for polyominoes, On linear layout of bicube and construction of optimal incomplete bicube, Emergence of Wulff-crystals from atomistic systems on the FCC and HCP lattices, A lower bound for the vertex boundary-width of complete \(k\)-ary trees, Isoperimetric Problem and Meta-fibonacci Sequences, Reflect-push methods. Part I: Two dimensional techniques, A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout, Morphisms for resistive electrical networks, Essential points of the \(n\)-cube subset partitioning characterisation, Embedding of hypercubes into necklace, windmill and snake graphs, Minimum wirelength of hypercubes into \(n\)-dimensional grid networks, Optimal Embedding of Locally Twisted Cubes into Grids, Maximal fluctuations around the Wulff shape for edge-isoperimetric sets in \({\mathbb{Z}}^d \): a sharp scaling law, Bandwidth of the product of paths of the same length, Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms., Embedding of hypercubes into sibling trees, Approximate convexity and an edge-isoperimetric estimate, Supersaturation and stability for forbidden subposet problems., Bothway embedding of circulant network into grid, An optimal time algorithm for minimum linear arrangement of chord graphs, On discrete Brunn-Minkowski and isoperimetric type inequalities, Isoperimetry in integer lattices, Curve Optimization of Tapered Cantilever Beams Under Tip Loads, A general method to determine limiting optimal shapes for edge-isoperimetric inequalities, Metastability of hard-core dynamics on bipartite graphs, Minimising the sum of projections of a finite set, Sharp \(N^{3/4}\) law for the minimizers of the edge-isoperimetric problem on the triangular lattice, Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees, On the bandwidth of 3-dimensional Hamming graphs, Linear wirelength of folded hypercubes, Wirelength of hypercubes into certain trees, Bandwidth and pathwidth of three-dimensional grids, On the isoperimetric spectrum of graphs and its approximations, A linear time algorithm for embedding hypercube into cylinder and torus, Maximum incomplete recursive circulants in graph embeddings, On the edge-bandwidth of graph products, Node set optimization problem for complete Josephus cubes, The carvingwidth of hypercubes, Proof of the Brown–Erdős–Sós conjecture in groups, Embedding of recursive circulants into certain necklace graphs, Beating treewidth for average-case subgraph isomorphism, Minimum linear arrangement of chord graphs, Lit-only sigma game on a line graph, Bounds on isoperimetric values of trees, Characterization of the congestion lemma on layout computation, Unnamed Item, On density of subgraphs of halved cubes, On explicit formulas for bandwidth and antibandwidth of hypercubes, Exact wirelength of hypercubes on a grid, On the complexity of isoperimetric problems on trees, Wulff shape emergence in graphene, Embedding algorithm of spined cube into grid structure and its wirelength computation, Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees, \(N^{3/4}\) law in the cubic lattice, Lower bounds for boxicity, Conjectures on wirelength of hypercube into cylinder and torus