New graph decompositions with applications to emulations

DOI10.1007/BF02679452zbMATH Open0870.68114MaRDI QIDQ675853FDOQ675853

Authors: Juan-Miguel Gracia 

Publication date: 7 September 1997

Published in: Theory of Computing Systems (Search for Journal in Brave)

Recommendations

• An approach to emulating separable graphs
• Optimal emulations by butterfly-like networks
• Uniform emulations of Cartesian-product and Cayley graphs

zbMATH Keywords

graph decompositioncut-coverhypercube networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A Separator Theorem for Planar Graphs
• Near-Linear Time Construction of Sparse Neighborhood Covers
• On the Problem of Partitioning Planar Graphs
• Title not available (Why is that?)
• Universality considerations in VLSI circuits
• Title not available (Why is that?)
• A framework for solving VLSI graph layout problems
• Excluded minors, network decomposition, and multicommodity flow
• Efficient Simulations among Several Models of Parallel Computers
• Optimal Rearrangeable Multistage Connecting Networks
• Efficiency of universal parallel computers
• Title not available (Why is that?)
• Work-preserving emulations of fixed-connection networks
• Multi-scale self-simulation

Cited In (1)

• An approach to emulating separable graphs

This page was built for publication: New graph decompositions with applications to emulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675853)