Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
From MaRDI portal
Publication:4875441
DOI10.1137/S0895480194272183zbMATH Open0847.05046OpenAlexW1974876810MaRDI QIDQ4875441FDOQ4875441
Lyudmil Aleksandrov, Hristo N. Djidjev
Publication date: 29 September 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480194272183
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (19)
- An external memory data structure for shortest path queries
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Layered separators in minor-closed graph classes with applications
- Graph separators: A parameterized view
- Title not available (Why is that?)
- Collective tree spanners in graphs with bounded parameters
- Title not available (Why is that?)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
- General lower bounds for the minor crossing number of graphs
- Planar and Toroidal Morphs Made Easier
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity
- Planar and toroidal morphs made easier
- Short and Simple Cycle Separators in Planar Graphs
- Counting models for 2SAT and 3SAT formulae
- Edge separators for graphs of bounded genus with applications
- Three problems about simple polygons
- Succinct and Implicit Data Structures for Computational Geometry
- Minimum Cuts in Surface Graphs
- Title not available (Why is that?)
Recommendations
This page was built for publication: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875441)
