Reduced constants for simple cycle graph separation
From MaRDI portal
Recommendations
Cited in
(21)- Theory and application of width bounded geometric separators
- On cleaving a planar graph
- How to catch marathon cheaters: new approximation algorithms for tracking paths
- Graph separators: A parameterized view
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem
- On the oriented diameter of planar triangulations
- scientific article; zbMATH DE number 1979709 (Why is no real title available?)
- scientific article; zbMATH DE number 4101213 (Why is no real title available?)
- Counting triangulations and other crossing-free structures approximately
- Clique-based separators for geometric intersection graphs
- Tabu search for the BWC problem
- Bounds for the oriented diameter of planar triangulations
- Counting cycles on planar graphs in subexponential time
- Short and simple cycle separators in planar graphs
- Counting cycles on planar graphs in subexponential time
- Drawing Planar Graphs with Reduced Height
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- Anticoloring of a family of grid graphs
- Maximum matchings in geometric intersection graphs
- Anticoloring and separation of graphs
- On classes of graphs with strongly sublinear separators
This page was built for publication: Reduced constants for simple cycle graph separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920221)
