{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:12Z","timestamp":1760203032188,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_33","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"416-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2395-4160","authenticated-orcid":false,"given":"Sankardeep","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8644-3691","authenticated-orcid":false,"given":"Seungbum","family":"Jo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8212-3682","authenticated-orcid":false,"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0636-9880","authenticated-orcid":false,"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Acan, H., Chakraborty, S., Jo, S., Satti, S.R.: Succinct data structures for families of interval graphs. In: WADS, pp. 1\u201313 (2019)","DOI":"10.1007\/978-3-030-24766-9_1"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Farzan, A.: Succinct representations of separable graphs. In: CPM, pp. 138\u2013150 (2010)","DOI":"10.1007\/978-3-642-13509-5_13"},{"issue":"8","key":"33_CR3","doi-asserted-by":"publisher","first-page":"2091","DOI":"10.1016\/j.ejc.2007.04.011","volume":"28","author":"M Bodirsky","year":"2007","unstructured":"Bodirsky, M., Gim\u00e9nez, O., Kang, M., Noy, M.: Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8), 2091\u20132105 (2007)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Le, V.B.: Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98(4), 133\u2013138 (2006)","journal-title":"Inf. Process. Lett."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Jo, S., Sadakane, K., Satti, S.R.: Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (2021). https:\/\/arxiv.org\/abs\/2108.10776","DOI":"10.1007\/978-3-030-92681-6_33"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Jo, S., Sadakane, K., Satti, S.R.: Succinct data structures for small clique-width graphs. In: 31st Data Compression Conference, DCC 2021, Snowbird, UT, USA, 23\u201326 March, 2021, pp. 133\u2013142. IEEE (2021)","DOI":"10.1109\/DCC50243.2021.00021"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Chauve, C., Fusy, \u00c9., Lumbroso, J.O.: An exact enumeration of distance-hereditary graphs. In: ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201317 January, 2017, pp. 31\u201345 (2017)","DOI":"10.1137\/1.9781611974775.3"},{"key":"33_CR8","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Graduate texts in mathematics, 4th edn., vol. 173. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1007\/s00453-016-0192-1","volume":"78","author":"H El-Zein","year":"2017","unstructured":"El-Zein, H., Lewenstein, M., Munro, J.I., Raman, V., Chan, T.M.: On the succinct representation of equivalence classes. Algorithmica 78(3), 1020\u20131040 (2017)","journal-title":"Algorithmica"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/s00453-012-9712-9","volume":"69","author":"A Farzan","year":"2014","unstructured":"Farzan, A., Kamali, S.: Compact navigation and distance Oracles for graphs with small treewidth. Algorithmica 69(1), 92\u2013116 (2014)","journal-title":"Algorithmica"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2013.09.031","volume":"513","author":"A Farzan","year":"2013","unstructured":"Farzan, A., Munro, J.I.: Succinct encoding of arbitrary graphs. Theor. Comput. Sci. 513, 38\u201352 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s00453-012-9664-0","volume":"68","author":"A Farzan","year":"2014","unstructured":"Farzan, A., Munro, J.I.: A uniform paradigm to succinctly encode various families of trees. Algorithmica 68(1), 16\u201340 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/828.322439","volume":"31","author":"Y Gurevich","year":"1984","unstructured":"Gurevich, Y., Stockmeyer, L.J., Vishkin, U.: Solving NP-Hard problems on graphs that are almost trees and an application to facility location problems. J. ACM 31(3), 459\u2013473 (1984)","journal-title":"J. ACM"},{"issue":"5","key":"33_CR15","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1063\/1.1747725","volume":"18","author":"K Husimi","year":"1950","unstructured":"Husimi, K.: Note on mayers\u2019 theory of cluster integrals. J. Chem. Phys. 18(5), 682\u2013684 (1950)","journal-title":"J. Chem. Phys."},{"key":"33_CR16","unstructured":"Jacobson, G.J.: Succinct static data structures. Ph.D. thesis, Carnegie Mellon University (1998)"},{"issue":"3","key":"33_CR17","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"JI Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"33_CR18","unstructured":"Munro, J.I., Wu, K.: Succinct data structures for chordal graphs. In: ISAAC, pp. 67:1\u201367:12 (2018)"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Nicholson, P.K.: Compressed representations of graphs. In: Encyclopedia of Algorithms, pp. 382\u2013386 (2016)","DOI":"10.1007\/978-1-4939-2864-4_646"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Compact Data Structures - A Practical Approach. Cambridge University Press, New York (2016)","DOI":"10.1017\/CBO9781316588284"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Navarro, G., Sadakane, K.: Fully functional static and dynamic succinct trees. ACM Trans. Algorithms 10(3), 16:1\u201316:39 (2014)","DOI":"10.1145\/2601073"},{"key":"33_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-40273-9_20","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"R Raman","year":"2013","unstructured":"Raman, R., Rao, S.S.: Succinct representations of ordinal trees. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 319\u2013332. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40273-9_20"},{"issue":"4","key":"33_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R Raman","year":"2007","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"1\u20134","key":"33_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/sapm194221183","volume":"21","author":"J Riordan","year":"1942","unstructured":"Riordan, J., Shannon, C.E.: The number of two-terminal series-parallel networks. J. Math. Phys. 21(1\u20134), 83\u201393 (1942). https:\/\/doi.org\/10.1002\/sapm194221183","journal-title":"J. Math. Phys."},{"issue":"4","key":"33_CR25","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theory Comput. Syst. 41(4), 589\u2013607 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"33_CR26","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12626-019-00044-2","volume":"13","author":"K Sumigawa","year":"2019","unstructured":"Sumigawa, K., Sadakane, K.: Storing partitions of integers in sublinear space. Rev. Socionetwork Strateg. 13(2), 237\u2013252 (2019)","journal-title":"Rev. Socionetwork Strateg."},{"issue":"02","key":"33_CR27","doi-asserted-by":"publisher","first-page":"1360001","DOI":"10.1142\/S179383091360001X","volume":"05","author":"T Uno","year":"2013","unstructured":"Uno, T., Uehara, R., Nakano, S.: Bounding the number of reduced trees, cographs, and series-parallel graphs by compression. Discrete Math. Algorithms Appl. 05(02), 1360001 (2013)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"2","key":"33_CR28","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"33_CR29","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1134\/S1990478914030156","volume":"8","author":"VA Voblyi","year":"2014","unstructured":"Voblyi, V.A., Meleshko, A.K.: Enumeration of labeled block-cactus graphs. J. Appl. Ind. Math. 8(3), 422\u2013427 (2014). https:\/\/doi.org\/10.1134\/S1990478914030156","journal-title":"J. Appl. Ind. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:07:42Z","timestamp":1639354062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}