scientific article; zbMATH DE number 1303032

MaRDI QIDQ4249532zbMATH OpenFDO

Authors Seok-Hee Hong, Peter Eades, Sang-Ho Lee

Publication date 17 August 1999

zbMATH Keywords

polynomial time algorithmplanar geometric automorphismssymmetric drawings of planar graphs

Mathematics Subject Classification ID

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)

Recommendations

• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• Drawing planar graphs symmetrically. III: Oneconnected planar graphs
• Geometric automorphism groups of graphs
• Testing planarity of geometric automorphisms in linear time
• scientific article; zbMATH DE number 2119683

Cited in

(9)

• scientific article; zbMATH DE number 4045185 (Why is no real title available?)
• Linkless symmetric drawings of series parallel digraphs
• scientific article; zbMATH DE number 1389215 (Why is no real title available?)
• Testing planarity of geometric automorphisms in linear time
• Spring algorithms and symmetry
• scientific article; zbMATH DE number 1974110 (Why is no real title available?)
• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• scientific article; zbMATH DE number 1234976 (Why is no real title available?)
• Drawing series parallel digraphs symmetrically

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249532)