The following pages link to (Q4458414):
Displaying 50 items.
- A problem of Shapozenko on Johnson graphs (Q283683) (← links)
- Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees (Q327683) (← links)
- A quantitative Gobbard-Satterthwaite theorem without neutrality (Q343234) (← links)
- Embeddings of circulant networks (Q358657) (← links)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks (Q436612) (← links)
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms. (Q465657) (← links)
- Approximate convexity and an edge-isoperimetric estimate (Q488741) (← links)
- Supersaturation and stability for forbidden subposet problems. (Q490923) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- A general method to determine limiting optimal shapes for edge-isoperimetric inequalities (Q510340) (← links)
- Bandwidth and pathwidth of three-dimensional grids (Q534058) (← links)
- Sharp \(N^{3/4}\) law for the minimizers of the edge-isoperimetric problem on the triangular lattice (Q683954) (← links)
- Linear wirelength of folded hypercubes (Q691637) (← links)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- Planar lattice subsets with minimal vertex boundary (Q820851) (← links)
- On the bandwidth of 3-dimensional Hamming graphs (Q955026) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- Bounds on isoperimetric values of trees (Q1011720) (← links)
- On explicit formulas for bandwidth and antibandwidth of hypercubes (Q1026164) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- On the bandwidth of a Hamming graph (Q1400004) (← links)
- The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\) (Q1658768) (← links)
- Simple polytopes without small separators (Q1678493) (← links)
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees (Q1751113) (← links)
- Wirelength of hypercubes into certain trees (Q1759856) (← links)
- Metastability of hard-core dynamics on bipartite graphs (Q1990231) (← links)
- Minimising the sum of projections of a finite set (Q1991096) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- Characterization of the congestion lemma on layout computation (Q2051622) (← links)
- Embedding algorithm of spined cube into grid structure and its wirelength computation (Q2072078) (← links)
- Edge isoperimetric inequalities for powers of the hypercube (Q2121790) (← links)
- Wirelength of embedding complete multipartite graphs into certain graphs (Q2181259) (← links)
- Isoperimetry, stability, and irredundance in direct products (Q2182213) (← links)
- Tiling-based models of perimeter and area (Q2182617) (← links)
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout (Q2201764) (← links)
- Maximal fluctuations around the Wulff shape for edge-isoperimetric sets in \({\mathbb{Z}}^d \): a sharp scaling law (Q2216764) (← links)
- On discrete Brunn-Minkowski and isoperimetric type inequalities (Q2237225) (← links)
- Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
- On density of subgraphs of halved cubes (Q2311351) (← links)
- \(N^{3/4}\) law in the cubic lattice (Q2328712) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- Conjectures on wirelength of hypercube into cylinder and torus (Q2354762) (← links)
- Layout of embedding locally twisted cube into the extended theta mesh topology (Q2413386) (← links)
- The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals (Q2414927) (← links)
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
- Morphisms for resistive electrical networks (Q2434733) (← links)
