{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:10:08Z","timestamp":1746252608315,"version":"3.40.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_21","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"273-286","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Complexity of Planar 3-Connected Graph Isomorphism"],"prefix":"10.1007","author":[{"given":"Jenish C.","family":"Mehta","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. In: Proceedings of the Forty-Third Annual IEEE Symposium on Foundations of Computer Science, pp. 743\u2013750. IEEE (2002)","DOI":"10.1109\/SFCS.2002.1181999"},{"key":"21_CR2","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education (2001)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Datta, S., Limaye, N., Nimbhorkar, P.: 3-connected Planar Graph Isomorphism is in Logspace. arXiv:0806.1041 (2008)","DOI":"10.1109\/CCC.2009.16"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Datta, S., Limaye, N., Nimbhorkar, P., Thierauf, T., Wagner, F.: Planar Graph Isomorphism is in Logspace. In: Proceedings of the Twenty-Fourth Annual IEEE Conference on Computational Complexity, pp. 203\u2013214. IEEE (2009)","DOI":"10.1109\/CCC.2009.16"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/inco.1995.1102","volume":"120","author":"G.Z. Dong","year":"1995","unstructured":"Dong, G.Z., Su, J.W.: Incremental and Decremental evaluation of Transitive Closure by First-Order queries. Information and Computation\u00a0120(1), 101\u2013106 (1995)","journal-title":"Information and Computation"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Etessami, K.: Dynamic Tree Isomorphism via First-Order Updates to a Relational Database. In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 235\u2013243. ACM (1998)","DOI":"10.1145\/275487.275514"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Hesse, W.: The Dynamic Complexity of Transitive Closure is in DynTC0. In: Proceedings of the Eighth International Conference on Database Theory. Citeseer (2002)","DOI":"10.1016\/S0304-3975(02)00740-5"},{"key":"21_CR9","unstructured":"Hesse, W.M.: Dynamic Computational Complexity. Computer Science (2003)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.-K.: Linear time algorithm for Isomorphism of Planar graphs (preliminary report). In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 172\u2013184. ACM (1974)","DOI":"10.1145\/800119.803896"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Descriptive Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Lindell, S.: A Logspace algorithm for Tree Canonization. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 400\u2013404. ACM (1992)","DOI":"10.1145\/129712.129750"},{"key":"21_CR13","unstructured":"Mehta, J.C.: Dynamic Complexity of Planar 3-connected Graph Isomorphism. arXiv (2013), http:\/\/arxiv.org\/abs\/1312.2141"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Patnaik, S., Immerman, N.: Dyn-FO (preliminary version): A Parallel, Dynamic Complexity Class. In: Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 210\u2013221. ACM (1994)","DOI":"10.1145\/182591.182614"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-39992-3_6","volume-title":"Logic, Language, Information, and Computation","author":"T. Schwentick","year":"2013","unstructured":"Schwentick, T.: Perspectives of Dynamic Complexity. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol.\u00a08071, pp. 33\u201333. Springer, Heidelberg (2013)"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s00224-009-9188-4","volume":"47","author":"T. Thierauf","year":"2010","unstructured":"Thierauf, T., Wagner, F.: The isomorphism problem for Planar 3-connected graphs is in Unambiguous Logspace. Theory of Computing Systems\u00a047(3), 655\u2013673 (2010)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.2307\/2371125","volume":"55","author":"H. Whitney","year":"1933","unstructured":"Whitney, H.: A set of topological invariants for graphs. American Journal of Mathematics\u00a055(1), 231\u2013235 (1933)","journal-title":"American Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:49:00Z","timestamp":1746251340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}