scientific article; zbMATH DE number 2060183
From MaRDI portal
Publication:4458414
Recommendations
Cited in
(89)- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Planar lattice subsets with minimal vertex boundary
- An extremal graph problem on a grid and an isoperimetric problem for polyominoes
- On linear layout of bicube and construction of optimal incomplete bicube
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- Node set optimization problem for complete Josephus cubes
- Edge isoperimetric inequalities for powers of the hypercube
- Embedding augmented cube into certain trees and windmill graphs
- Proof of the Brown-Erdős-Sós conjecture in groups
- Conjectures on wirelength of hypercube into cylinder and torus
- Bounds on isoperimetric values of trees
- On the bandwidth of a Hamming graph
- Linear wirelength of folded hypercubes
- Bandwidth and pathwidth of three-dimensional grids
- Embedding circulant networks into butterfly and benes networks
- Bandwidth of the product of paths of the same length
- scientific article; zbMATH DE number 736286 (Why is no real title available?)
- On a problem of Kleitman and West
- Minimum linear arrangement of chord graphs
- On the isoperimetric spectrum of graphs and its approximations
- Metastability of hard-core dynamics on bipartite graphs
- A linear time algorithm for embedding hypercube into cylinder and torus
- Embedding of hypercubes into necklace, windmill and snake graphs
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- scientific article; zbMATH DE number 7250384 (Why is no real title available?)
- Essential points of the \(n\)-cube subset partitioning characterisation
- Maximal fluctuations around the Wulff shape for edge-isoperimetric sets in \({\mathbb{Z}}^d \): a sharp scaling law
- Maximum incomplete recursive circulants in graph embeddings
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees
- Lower bounds for boxicity
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- \(N^{3/4}\) law in the cubic lattice
- Pull-push method: a new approach to edge-isoperimetric problems
- Minimum linear arrangement of the Cartesian product of optimal order graph and path
- Optimal embedding of locally twisted cubes into grids
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Wirelength of enhanced hypercubes into r-rooted complete binary trees
- Lit-only sigma game on a line graph
- Isoperimetry, stability, and irredundance in direct products
- On the edge-bandwidth of graph products
- The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\)
- Isoperimetric problems and compression
- Beating treewidth for average-case subgraph isomorphism
- Morphisms for resistive electrical networks
- A local-global principle for vertex-isoperimetric problems
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.
- Wulff shape emergence in graphene
- Morphisms for the maximum weight ideal problem
- Reflect-push methods. Part I: Two dimensional techniques
- The carvingwidth of hypercubes
- Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
- On the complexity of isoperimetric problems on trees
- Characterization of the congestion lemma on layout computation
- A quantitative Gobbard-Satterthwaite theorem without neutrality
- Simple polytopes without small separators
- Exact wirelength of hypercubes on a grid
- Emergence of Wulff-crystals from atomistic systems on the FCC and HCP lattices
- Approximate convexity and an edge-isoperimetric estimate
- Optimal embedding of hypercube into cylinder
- A rigorous proof on circular wirelength for hypercubes
- Supersaturation and stability for forbidden subposet problems.
- Bothway embedding of circulant network into grid
- Wiener index via wirelength of an embedding
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
- Embedding of hypercubes into sibling trees
- Embeddings of circulant networks
- Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength
- Embedding of hypercube into fractal cubic network
- Tiling-based models of perimeter and area
- Embedding of recursive circulants into certain necklace graphs
- Isoperimetry in integer lattices
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Wirelength of hypercubes into certain trees
- Wirelength of embedding complete multipartite graphs into certain graphs
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- scientific article; zbMATH DE number 5117215 (Why is no real title available?)
- A general method to determine limiting optimal shapes for edge-isoperimetric inequalities
- Layout of embedding locally twisted cube into the extended theta mesh topology
- The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals
- Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
- On discrete Brunn-Minkowski and isoperimetric type inequalities
- Isoperimetric Problem and Meta-fibonacci Sequences
- Sharp \(N^{3/4}\) law for the minimizers of the edge-isoperimetric problem on the triangular lattice
- On density of subgraphs of halved cubes
- Curve optimization of tapered cantilever beams under tip loads
- Minimising the sum of projections of a finite set
- Edge-isoperimetric problem for Cayley graphs and generalized Takagi functions
- On the bandwidth of 3-dimensional Hamming graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458414)
