New graph decompositions with applications to emulations
From MaRDI portal
Publication:675853
DOI10.1007/BF02679452zbMath0870.68114MaRDI QIDQ675853
Publication date: 7 September 1997
Published in: Theory of Computing Systems (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework for solving VLSI graph layout problems
- Efficiency of universal parallel computers
- Efficient Simulations among Several Models of Parallel Computers
- A Separator Theorem for Planar Graphs
- Universality considerations in VLSI circuits
- On the Problem of Partitioning Planar Graphs
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Work-preserving emulations of fixed-connection networks
- Multi-scale self-simulation
- Excluded minors, network decomposition, and multicommodity flow
- Optimal Rearrangeable Multistage Connecting Networks
This page was built for publication: New graph decompositions with applications to emulations
