Fast detection and display of symmetry in outerplanar graphs

DOI10.1016/0166-218X(92)90112-NzbMath0768.68165OpenAlexW2005574100MaRDI QIDQ1199463

Mikhail J. Atallah, Joseph Manning

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

algorithmspartitioningembeddingsymmetriesdrawingouterplanar graphsregular polygondetectionisomorphism classesbiconnectivitydisplay

Mathematics Subject Classification ID

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

Related Items (11)

Linkless symmetric drawings of series parallel digraphs ⋮ Unnamed Item ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ Geometric automorphism groups of graphs ⋮ Area requirement and symmetry display of planar upward drawings ⋮ The Laplacian spectral radius of graphs on surfaces ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ Unnamed Item ⋮ Spring algorithms and symmetry ⋮ Drawing series parallel digraphs symmetrically ⋮ Heuristics for the maximum outerplanar subgraph problem

Cites Work

• Optimal algorithms for finding the symmetries of a planar point set
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• Lexicographically least circular substrings
• Parallel concepts in graph theory
• Optimal algorithms for symmetry detection in two and three dimensions
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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