An approach to emulating separable graphs
From MaRDI portal
Recommendations
- Graph separators, with applications
- On the separability of graphs
- New graph decompositions with applications to emulations
- On embedding well-separable graphs
- scientific article; zbMATH DE number 4208112
- Succinct representations of separable graphs
- scientific article; zbMATH DE number 1953093
- Parameterized graph separation problems
- Parameterized and Exact Computation
- scientific article; zbMATH DE number 861319
Cites work
- A framework for solving VLSI graph layout problems
- A unified framework for off-line permutation routing in parallel networks
- Bisection of Circle Colorings
- Efficient Embeddings of Trees in Hypercubes
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- Laying Out Graphs Using Queues
- Optimal embeddings of butterfly-like graphs in the hypercube
- Optimal emulations by butterfly-like networks
- Parallel Processing with the Perfect Shuffle
- Product-shuffle networks: Toward reconciling shuffles and butterflies
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
Cited in
(6)- Separator-based graph embedding into multidimensional grids with small edge-congestion
- Simulation of large networks on smaller networks
- EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES*
- Optimal emulations by butterfly-like networks
- Uniform d‐emulations of rings, with an application to distributed virtual ring construction
- New graph decompositions with applications to emulations
This page was built for publication: An approach to emulating separable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277376)
