Testing planarity of geometric automorphisms in linear time

DOI10.1007/s00453-007-9050-5zbMath1171.68389OpenAlexW2083362998MaRDI QIDQ1018045

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

zbMATH Keywords

automorphismssymmetriesplanaritygraph drawing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• PIGALE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Spring algorithms and symmetry
• Crossing minimization for symmetries
• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• Drawing planar graphs symmetrically. III: Oneconnected planar graphs
• Efficient Planarity Testing
• On-Line Planarity Testing
• Dividing a Graph into Triconnected Components
• Algorithms and Computation
• Graph Drawing
• Depth-First Search and Linear Graph Algorithms