{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:21Z","timestamp":1725487281452},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_35","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"372-383","source":"Crossref","is-referenced-by-count":6,"title":["On Maximum Symmetric Subgraphs"],"prefix":"10.1007","author":[{"given":"Ho-Lin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Hsueh-I.","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"35_CR1","first-page":"95","volume":"E75-D","author":"T. Akutsu","year":"1992","unstructured":"T. Akutsu, An RNC algorithm for finding a largest common subtree of two trees, IEICE Transactions on Information Systems, E75-D, pp. 95\u2013101, 1992.","journal-title":"IEICE Transactions on Information Systems"},{"key":"35_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-46648-7_30","volume-title":"Isomorphic Subgraphs","author":"S. Bachl","year":"1999","unstructured":"S. Bachl, Isomorphic Subgraphs, International Symposium on Graph Drawing (GD\u201999), LNCS 1731, pp. 286\u2013296, 1999."},{"key":"35_CR3","unstructured":"G. Di Battista, P. Eades, and R. Tamassia and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999."},{"key":"35_CR4","unstructured":"K. Chin and H. Yen, The Symmetry Number Problem for Trees, manuscript, 1998."},{"key":"35_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/3-540-46648-7_29","volume-title":"A Heuristic for Graph Symmetry Detection","author":"F. Fraysseix de","year":"1999","unstructured":"F. de Fraysseix, A Heuristic for Graph Symmetry Detection, International Symposium on Graph Drawing (GD\u201999), LNCS 1731, pp. 276\u2013285, 1999."},{"key":"35_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BFb0045087","volume-title":"Computing and Combinatorics (COCOON\u201997)","author":"P. Eades","year":"1997","unstructured":"P. Eades and X. Lin, Spring Algorithms and Symmetry, Computing and Combinatorics (COCOON\u201997), LNCS 1276, pp. 202\u2013211, 1997."},{"key":"35_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979."},{"key":"35_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-49381-6_30","volume-title":"Finding Planar Geometric Automorphisms in Planar Graphs","author":"S. Hong","year":"1998","unstructured":"S. Hong, P. Eades, and S. Lee, Finding Planar Geometric Automorphisms in Planar Graphs, 9th International Symposium on Algorithms and Computation (ISAAC\u201998) LNCS 1533, Springer, pp. 277\u2013286, 1998."},{"key":"35_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-37623-2_15","volume-title":"Drawing Algorithms for Series Parallel Digraphs in Three Dimensions","author":"S. Hong","year":"1998","unstructured":"S. Hong, P. Eades, A. Quigley, and S. Lee, Drawing Algorithms for Series Parallel Digraphs in Three Dimensions, International Symposium on Graph Drawing (GD\u201998), LNCS 1547, pp. 198\u2013209, 1998."},{"key":"35_CR10","unstructured":"S. Hong, P. Eades, A. Quigley, and S. Lee, Drawing Series-Parallel Digraphs Symmetrically, manuscript, 1999."},{"issue":"1","key":"35_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0020-0190(71)90019-6","volume":"1","author":"J. Hopcroft","year":"1971","unstructured":"J. Hopcroft and R. Tarjan, A V\n                           2 Algorithm for Determining Isomorphism of Planar Graphs, Information Processing Letters, 1(1):32\u201334, 1971.","journal-title":"Information Processing Letters"},{"issue":"2","key":"35_CR12","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpelainen","year":"1995","unstructured":"P. Kilpelainen, and H. Mannila, Ordered and Unordered Tree Inclusion, SIAM Journal on Computing 24(2):340\u2013356, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"35_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Computing the Edit Distance Between Unrooted Ordered Trees","author":"P. Klein","year":"1998","unstructured":"P. Klein, Computing the Edit Distance Between Unrooted Ordered Trees, 6th European Symposium on Algorithms (ESA\u201998), LNCS 1461, 91\u2013102, 1998."},{"key":"35_CR14","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawer","year":"1976","unstructured":"E. Lawer, Combinatorial Optimization: Networks and Matroids, New York: Holt, Rinehart & Winston, 1976."},{"key":"35_CR15","unstructured":"J. Manning, Geometric Symmetry in Graphs, Ph.D. Dissertation, Department of Computer Science, Purdue University, 1990."},{"key":"35_CR16","first-page":"159","volume":"64","author":"J. Manning","year":"1988","unstructured":"J. Manning and M. Atallah. Fast Detection and Display of Symmetry in Trees, Congressus Numerantium, 64:159\u2013169, 1988.","journal-title":"Congressus Numerantium"},{"key":"35_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/3-540-58950-3_378","volume-title":"A System for Drawing Graphs with Geometric Symmetry","author":"J. Manning","year":"1995","unstructured":"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\u201995), LNCS 894, pp. 262\u2013265, 1995."},{"key":"35_CR18","unstructured":"C. Papadimitriou, Computational Complexity, Addison-Wesley, 1994."},{"issue":"5","key":"35_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K. Zhang","year":"1994","unstructured":"K. Zhang, and T. Jiang, Some MAX SNP-hard Results Concerning Unordered Labeled Trees, Information Processing Letters 49(5):249\u2013254, 1994.","journal-title":"Information Processing Letters"},{"issue":"6","key":"35_CR20","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"K. Zhang, and D. Shasha, Simple Fast Algorithms for the Editing Distance between Trees and Related Problems, SIAM Journal on Computing 18(6):1245\u20131262, 1989.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T18:53:06Z","timestamp":1550429586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}