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