Graph separators, with applications

MaRDI QIDQ2748499zbMATH OpenFDO

Authors Arnold L. Rosenberg, Lenwood S. Heath

Publication date 15 October 2001

zbMATH Keywords

graph separatorVLSI-circuits

Mathematics Subject Classification ID

Hypergraphs (05C65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 16297
• scientific article; zbMATH DE number 4132095
• scientific article; zbMATH DE number 3914339
• Weighted graph separators and their applications
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

Cited in

(21)

• An experimental evaluation of local search heuristics for graph partitioning
• The separator theorem for rooted directed vertex graphs
• Minimal congestion trees
• The size and depth of layered Boolean circuits
• Solution methods for the vertex variant of the network system vulnerability analysis problem
• Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
• Separator-based graph embedding into multidimensional grids with small edge-congestion
• Segre's hemisystem and McLaughlin's graph
• A near optimal algorithm for edge separators (preliminary version)
• scientific article; zbMATH DE number 4091555 (Why is no real title available?)
• scientific article; zbMATH DE number 16297 (Why is no real title available?)
• New constructions of SSPDs and their applications
• An approach to emulating separable graphs
• scientific article; zbMATH DE number 1953093 (Why is no real title available?)
• Graph layouts via layered separators
• scientific article; zbMATH DE number 867693 (Why is no real title available?)
• A new lower bound on the size of the smallest vertex separator of a graph
• On finding separators in temporal split and permutation graphs
• Finding minimum balanced separators -- an exact approach
• \(N\)-separators in planar graphs
• Embedding multidimensional grids into optimal hypercubes

This page was built for publication: Graph separators, with applications

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