{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:39:21Z","timestamp":1743075561036,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_25","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"296-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Enumeration of Non-isomorphic Ptolemaic Graphs"],"prefix":"10.1007","author":[{"given":"Dat Hoang","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"25_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"key":"25_CR3","unstructured":"Harasawa, S., Uehara, R.: Efficient enumeration of connected proper interval graphs. IEICE Technical report COMP2018-44, IEICE, pp. 9\u201316, March 2019. (in Japanese)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/jgt.3190050314","volume":"5","author":"E Howorka","year":"1981","unstructured":"Howorka, E.: A characterization of ptolemaic graphs. J. Graph Theory 5, 323\u2013331 (1981)","journal-title":"J. Graph Theory"},{"key":"25_CR5","unstructured":"Ikeda, S., Uehara, R.: Implementation of enumeration algorithm for connected bipartite permutation graphs. IEICE Technical report COMP2018-45, IEICE, pp. 17\u201323, March 2019. (in Japanese)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Nakano","year":"2004","unstructured":"Nakano, S., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 33\u201345. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30559-0_3"},{"key":"25_CR7","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization. AC, vol. 21. Springer, Heidelberg (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-662-56039-6"},{"key":"25_CR8","unstructured":"Mikos, P.: Efficient enumeration of non-isomorphic interval graphs. \narXiv:1906.04094\n\n, June 2019"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jda.2011.11.001","volume":"10","author":"T Saitoh","year":"2012","unstructured":"Saitoh, T., Otachi, Y., Yamanaka, K., Uehara, R.: Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms 10, 84\u201397 (2012). \nhttps:\/\/doi.org\/10.1016\/j.jda.2011.11.001","journal-title":"J. Discrete Algorithms"},{"issue":"D(7)","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1816","DOI":"10.1587\/transinf.E93.D.1816","volume":"E93","author":"T Saitoh","year":"2010","unstructured":"Saitoh, T., Yamanaka, K., Kiyomi, M., Uehara, R.: Random generation and enumeration of proper interval graphs. IEICE Trans. Inf. Syst. E93(D(7)), 1816\u20131823 (2010)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"25_CR11","doi-asserted-by":"publisher","DOI":"10.1090\/fim\/019","volume-title":"Efficient Graph Representations","author":"JP Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society, Providence (2003)"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.dam.2004.06.008","volume":"145","author":"R Uehara","year":"2004","unstructured":"Uehara, R., Toda, S., Nagoya, T.: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discrete Appl. Math. 145(3), 479\u2013482 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"25_CR13","first-page":"87","volume":"16","author":"R Uehara","year":"2014","unstructured":"Uehara, R.: The graph isomorphism problem on geometric graphs. Discrete Math. Theoret. Comput. Sci. 16(2), 87\u201396 (2014)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"issue":"7","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/j.dam.2008.09.006","volume":"157","author":"R Uehara","year":"2009","unstructured":"Uehara, R., Uno, Y.: Laminar structure of ptolemaic graphs with applications. Discrete Appl. Math. 157(7), 1533\u20131543 (2009)","journal-title":"Discrete Appl. Math."},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.tcs.2019.04.017","volume":"806","author":"Kazuaki Yamazaki","year":"2020","unstructured":"Yamazaki, K., Saitoh, T., Kiyomi, M., Uehara, R.: Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. Theoret. Comput. Sci. (2019, accepted). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2019.04.017","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:06:31Z","timestamp":1582139191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}