Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Geometric symmetry in graphs
Some MAX SNP-hard results concerning unordered labeled trees
Information Processing Letters
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding Planar Geometric Automorphisms in Planar Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Spring Algorithms and Symmetry
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
An Heuristic for Graph Symmetry Detection
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
A System for Drawing Graphs with Geometric Symmetry
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Computing and Drawing Isomorphic Subgraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Untangling graphs representing spatial relationships driven by drawing aesthetics
Proceedings of the 17th Panhellenic Conference on Informatics
| Hi-index | 0.00 |
Let G be an n-node graph. We address the problem of computing a maximum symmetric graph H from G by deleting nodes, deleting dges, and contracting edges. This NP-complete problem arises naturally from the objective of drawing G as symmetrically as possible. We show that its tractability for the special cases of G being a plane graph, an ordered tree, and an unordered tree, depends on the type of operations used to obtain H from G. Moreover, we give an O(log n)-approximation algorithm for the intractable case that H is obtained from a tree G by contracting edges. As a by-product, we give an O(log n)-approximation algorithm for an NP-complete edit-distance problem.