Reduced constants for simple cycle graph separation
From MaRDI portal
Publication:1920221
DOI10.1007/S002360050082zbMATH Open0865.05049OpenAlexW1996700055MaRDI QIDQ1920221FDOQ1920221
Authors: Hristo N. Djidjev, Shankar M. Venkatesan 
Publication date: 5 June 1997
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050082
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)
Cited In (21)
- Anticoloring and separation of graphs
- 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 classes of graphs with strongly sublinear separators
- Title not available (Why is that?)
- Drawing Planar Graphs with Reduced Height
- Counting cycles on planar graphs in subexponential time
- Counting cycles on planar graphs in subexponential time
- Theory and application of width bounded geometric separators
- Tabu search for the BWC problem
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- Maximum matchings in geometric intersection graphs
- On the oriented diameter of planar triangulations
- Bounds for the oriented diameter of planar triangulations
- On cleaving a planar graph
- Title not available (Why is that?)
- Clique-based separators for geometric intersection graphs
- Short and simple cycle separators in planar graphs
- Anticoloring of a family of grid graphs
- Counting triangulations and other crossing-free structures approximately
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)
