Testing planarity of geometric automorphisms in linear time
From MaRDI portal
Recommendations
- Finding planar geometric automorphisms in planar graphs (extended abstract)
- Drawing planar graphs symmetrically. II: Biconnected planar graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- A Planarity Test via Construction Sequences
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
Cites work
- A group-theoretic method for drawing graphs symmetrically
- A linear time implementation of SPQR-trees
- Algorithms and Computation
- Crossing minimization for symmetries
- Crossing minimization for symmetries
- Depth-First Search and Linear Graph Algorithms
- Detecting symmetries by branch \& cut
- Dividing a Graph into Triconnected Components
- Drawing planar graphs symmetrically. II: Biconnected planar graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- Efficient Planarity Testing
- Graph Drawing
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 2119683 (Why is no real title available?)
- scientific article; zbMATH DE number 1389215 (Why is no real title available?)
- On maximum symmetric subgraphs
- On-Line Planarity Testing
- Spring algorithms and symmetry
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(3)
This page was built for publication: Testing planarity of geometric automorphisms in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018045)