Testing planarity of geometric automorphisms in linear time
From MaRDI portal
Publication:1018045
DOI10.1007/S00453-007-9050-5zbMATH Open1171.68389OpenAlexW2083362998MaRDI QIDQ1018045FDOQ1018045
Authors: Christoph Buchheim, Seok-Hee Hong 
Publication date: 13 May 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/517/2/zaik2006-517.pdf
Recommendations
- scientific article; zbMATH DE number 1303032
- 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
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Efficient Planarity Testing
- Title not available (Why is that?)
- On-Line Planarity Testing
- Dividing a Graph into Triconnected Components
- Title not available (Why is that?)
- Spring algorithms and symmetry
- Crossing minimization for symmetries
- Drawing planar graphs symmetrically. II: Biconnected planar graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms and Computation
- Graph Drawing
Cited In (2)
Uses Software
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)
