Testing planarity of geometric automorphisms in linear time

DOI10.1007/S00453-007-9050-5MaRDI QIDQ1018045zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

automorphismssymmetriesplanaritygraph drawing

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 2084276 (Why is no real title available?)
• scientific article; zbMATH DE number 3882430 (Why is no real title available?)
• scientific article; zbMATH DE number 1974110 (Why is no real title available?)
• scientific article; zbMATH DE number 1979530 (Why is no real title available?)
• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• scientific article; zbMATH DE number 2080115 (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?)
• Algorithms and Computation
• Crossing minimization for symmetries
• Depth-First Search and Linear Graph Algorithms
• 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
• 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

(2)

• A direct linear-time planarity test for unflippable modules
• Testing Full Outer-2-planarity in Linear Time

Describes a project that uses

Uses Software

• PIGALE

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)