Fast detection and display of symmetry in outerplanar graphs

DOI10.1016/0166-218X(92)90112-NMaRDI QIDQ1199463zbMATH OpenOpenAlexFDO

Authors Joseph Manning, Mikhail J. Atallah

Publication date 16 January 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(92)90112-n

zbMATH Keywords

algorithmsbiconnectivitydetectiondisplaydrawingembeddingisomorphism classesouterplanar graphspartitioningregular polygonsymmetries

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• Drawing planar graphs symmetrically. III: Oneconnected planar graphs
• scientific article; zbMATH DE number 4114655
• scientific article; zbMATH DE number 2119683
• A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs

Cites work

• Fast Pattern Matching in Strings
• Graph theory with applications
• scientific article; zbMATH DE number 45992 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3614802 (Why is no real title available?)
• scientific article; zbMATH DE number 4114655 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Lexicographically least circular substrings
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• Optimal algorithms for finding the symmetries of a planar point set
• Optimal algorithms for symmetry detection in two and three dimensions
• Parallel concepts in graph theory

Cited in

(18)

• Area requirement and symmetry display of planar upward drawings
• Spring algorithms and symmetry
• Perception of symmetries in drawings of graphs
• Drawing series parallel digraphs symmetrically
• Linkless symmetric drawings of series parallel digraphs
• Symmetry detection and classification in drawings of graphs
• Geometric automorphism groups of graphs
• The Laplacian spectral radius of graphs on surfaces
• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• Heuristics for the maximum outerplanar subgraph problem
• Maxregularity and maximal outerplanar graphs
• Automatic Symmetry Detection in Well-Formed Nets
• scientific article; zbMATH DE number 4114655 (Why is no real title available?)
• scientific article; zbMATH DE number 2086772 (Why is no real title available?)
• scientific article; zbMATH DE number 1389215 (Why is no real title available?)
• A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications
• A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
• An improved algorithm for finding maximum outerplanar subgraphs

This page was built for publication: Fast detection and display of symmetry in outerplanar graphs

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