On maximum symmetric subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 372-383

  Chen, Ho Lin ^a   Lu, Hsueh I ^b   Yen, Hsu Chun ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DRAWING (GRAPHICS); FORESTRY; GRAPH THEORY;

A-PLANE; EDIT DISTANCE; NODE GRAPH; NP COMPLETE; ORDERED TREE; SUBGRAPHS; UNORDERED TREES;

TREES (MATHEMATICS);

EID: 84958544289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_35     Document Type: Conference Paper

References (20)

1. T. Akutsu, An RNC algorithm for finding a largest common subtree of two trees, IEICE Transactions on Information Systems, E75-D, pp. 95-101, 1992.
2. S. Bachl, Isomorphic Subgraphs, International Symposium on Graph Drawing (GD'99), LNCS 1731, pp. 286-296, 1999.
3. G. Di Battista, P. Eades, and R. Tamassia and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.
4. K. Chin and H. Yen, The Symmetry Number Problem for Trees, manuscript, 1998.
5. F. de Fraysseix, A Heuristic for Graph Symmetry Detection, International Symposium on Graph Drawing (GD'99), LNCS 1731, pp. 276-285, 1999.
6. P. Eades and X. Lin, Spring Algorithms and Symmetry, Computing and Combinatorics (COCOON'97), LNCS 1276, pp. 202-211, 1997.
7. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
8. S. Hong, P. Eades, and S. Lee, Finding Planar Geometric Automorphisms in Planar Graphs, 9th International Symposium on Algorithms and Computation (ISAAC'98) LNCS 1533, Springer, pp. 277-286, 1998.
9. S. Hong, P. Eades, A. Quigley, and S. Lee, Drawing Algorithms for SeriesParallel Digraphs in Three Dimensions, International Symposium on Graph Drawing (GD'98), LNCS 1547, pp. 198-209, 1998.
10. S. Hong, P. Eades, A. Quigley, and S. Lee, Drawing Series-Parallel Digraphs Symmetrically, manuscript, 1999.
11. J. Hopcroft and R. Tarjan, A V 2 Algorithm for Determining Isomorphism of Planar Graphs, Information Processing Letters, 1(1):32-34, 1971.
12. P. Kilpelainen, and H. Mannila, Ordered and Unordered Tree Inclusion, SIAM Journal on Computing 24(2):340-356, 1995.
13. P. Klein, Computing the Edit Distance Between Unrooted Ordered Trees, 6th European Symposium on Algorithms (ESA'98), LNCS 1461, 91-102, 1998.
14. E. Lawer, Combinatorial Optimization: Networks and Matroids, New York: Holt, Rinehart & Winston, 1976.
15. J. Manning, Geometric Symmetry in Graphs, Ph.D. Dissertation, Department of Computer Science, Purdue University, 1990.
16. J. Manning and M. Atallah. Fast Detection and Display of Symmetry in Trees, Congressus Numerantium, 64:159-169, 1988.
17. J. Manning, M. Atallah, K. Cudjoe, J. Lozito, and R. Pacheco. A System for Drawing Graphs with Geometric Symmetry, International Symposium on Graph Drawing (GD'95), LNCS 894, pp. 262-265, 1995.
18. C. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
19. K. Zhang, and T. Jiang, Some MAX SNP-hard Results Concerning Unordered Labeled Trees, Information Processing Letters 49(5):249-254, 1994.
20. K. Zhang, and D. Shasha, Simple Fast Algorithms for the Editing Distance between Trees and Related Problems, SIAM Journal on Computing 18(6):1245-1262, 1989.