Reduced constants for simple cycle graph separation
From MaRDI portal
Publication:1920221
DOI10.1007/s002360050082zbMath0865.05049OpenAlexW1996700055MaRDI QIDQ1920221
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
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Graph separators: A parameterized view, How to catch marathon cheaters: new approximation algorithms for tracking paths, Tabu search for the BWC problem, Maximum matchings in geometric intersection graphs, Clique-based separators for geometric intersection graphs, Bounds for the oriented diameter of planar triangulations, Counting cycles on planar graphs in subexponential time, Counting cycles on planar graphs in subexponential time, Theory and application of width bounded geometric separators, Sublinear time width-bounded separators and their application to the protein side-chain packing problem, Anticoloring of a family of grid graphs, On classes of graphs with strongly sublinear separators, Anticoloring and separation of graphs, MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING, Drawing Planar Graphs with Reduced Height, Counting triangulations and other crossing-free structures approximately, Short and Simple Cycle Separators in Planar Graphs
