{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:35:54Z","timestamp":1743147354007,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_27","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"322-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Space-Efficient Euler Partition and Bipartite Edge Coloring"],"prefix":"10.1007","author":[{"given":"Torben","family":"Hagerup","sequence":"first","affiliation":[]},{"given":"Frank","family":"Kammer","sequence":"additional","affiliation":[]},{"given":"Moritz","family":"Laudahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"issue":"6","key":"27_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0020-0190(02)00446-5","volume":"85","author":"N Alon","year":"2003","unstructured":"Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inform. Process. Lett. 85(6), 301\u2013302 (2003)","journal-title":"Inform. Process. Lett."},{"key":"27_CR2","unstructured":"Clark, D.: Compact Pat trees. Ph.D. thesis, University of Waterloo (1996)"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R Cole","year":"1982","unstructured":"Cole, R., Hopcroft, J.: On edge coloring bipartite graphs. SIAM J. Comput. 11(3), 540\u2013546 (1982)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in $$O(E \\log D)$$ time. Combinatorica 21(1), 5\u201312 (2001)","journal-title":"Combinatorica"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R Cole","year":"1986","unstructured":"Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Inform. Control 70(1), 32\u201353 (1986)","journal-title":"Inform. Control"},{"key":"27_CR6","unstructured":"Elmasry, A., Hagerup, T., Kammer, F.: Space-efficient basic graph algorithms. In: Mayr, E.W., Ollinger, N. (eds.) Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). LIPIcs, vol. 30, pp. 288\u2013301. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"27_CR7","first-page":"257","volume":"2","author":"M Fleury","year":"1883","unstructured":"Fleury, M.: Deux probl\u00e8mes de g\u00e9om\u00e9trie de situation. J. Math. \u00c9l\u00e9m. 2nd Ser. 2, 257\u2013261 (1883)","journal-title":"J. Math. \u00c9l\u00e9m. 2nd Ser."},{"issue":"4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00998632","volume":"5","author":"HN Gabow","year":"1976","unstructured":"Gabow, H.N.: Using Euler partitions to edge color bipartite multigraphs. Int. J. Comput. Inform. Sci. 5(4), 345\u2013355 (1976)","journal-title":"Int. J. Comput. Inform. Sci."},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/0211009","volume":"11","author":"HN Gabow","year":"1982","unstructured":"Gabow, H.N., Kariv, O.: Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput. 11(1), 117\u2013129 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.tcs.2006.09.014","volume":"368","author":"RF Geary","year":"2006","unstructured":"Geary, R.F., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368(3), 231\u2013246 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR11","unstructured":"Hagerup, T., Kammer, F.: Succinct choice dictionaries. Computing Research Repository (CoRR) arXiv:1604.06058 [cs.DS] (2016)"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C Hierholzer","year":"1873","unstructured":"Hierholzer, C.: Ueber die M\u00f6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Math. Ann. 6(1), 30\u201332 (1873). (communicated by Wiener, C.)","journal-title":"Math. Ann."},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0020-0190(02)00273-9","volume":"84","author":"K Makino","year":"2002","unstructured":"Makino, K., Takabatake, T., Fujishige, S.: A simple matching algorithm for regular bipartite graphs. Inform. Process. Lett. 84(4), 189\u2013193 (2002)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"27_CR15","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."},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/S0097539796299266","volume":"28","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Bipartite edge coloring in $$O(\\Delta m)$$ time. SIAM J. Comput. 28(3), 841\u2013846 (1998)","journal-title":"SIAM J. Comput."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Yao, F., Luks, E. (eds.) Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 343\u2013350. ACM (2000)","DOI":"10.1145\/335305.335345"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:50:06Z","timestamp":1710341406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}