{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:07Z","timestamp":1759639087286,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_1","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fully Dynamic Arboricity Maintenance"],"prefix":"10.1007","author":[{"given":"Niranka","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"1_CR1","unstructured":"Berglin, E., Brodal, G.S.: A simple greedy algorithm for dynamic graph orientation. In: 28th International Symposium on Algorithms and Computation, ISAAC 2017, Phuket, Thailand, 9\u201312 December 2017, pp. 12:1\u201312:12 (2017)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Fagerberg, R.: Dynamic representation of sparse graphs. In: 6th International Workshop on Algorithms and Data Structures, WADS 1999, Vancouver, British Columbia, Canada, 11\u201314 August 1999, Proceedings, pp. 342\u2013351 (1999)","DOI":"10.1007\/3-540-48447-7_34"},{"key":"1_CR3","first-page":"73","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Lehman\u2019s switching game and a theorem of Tutte and Nash-Williams. Natl Bur. Stan. 69B, 73\u201377 (1965)","journal-title":"Natl Bur. Stan."},{"key":"1_CR4","first-page":"67","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Minimum partition of a matroid into independent subsets. Natl Bur. Stan. 69B, 67\u201372 (1965)","journal-title":"Natl Bur. Stan."},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51(4), 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"key":"1_CR6","unstructured":"Erickson, J.: http:\/\/jeffe.cs.illinois.edu\/teaching\/datastructures\/2006\/problems\/bill-arboricity.pdf"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1006\/jagm.1997.0904","volume":"26","author":"HN Gabow","year":"1998","unstructured":"Gabow, H.N.: Algorithms for graphic polymatroids and parametriscs-sets. J. Algorithms 26(1), 48\u201386 (1998)","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"1_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0166-218X(98)00007-9","volume":"84","author":"R Grossi","year":"1998","unstructured":"Grossi, R., Lodi, E.: Simple planar graph partition into three forests. Discrete Appl. Math. 84(1\u20133), 121\u2013132 (1998)","journal-title":"Discrete Appl. Math."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-319-13075-0_11","volume-title":"Algorithms and Computation","author":"M He","year":"2014","unstructured":"He, M., Tang, G., Zeh, N.: Orienting dynamic graphs, with applications to maximal matchings and adjacency queries. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 128\u2013140. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_11"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-662-43951-7_45","volume-title":"Automata, Languages, and Programming","author":"T Kopelowitz","year":"2014","unstructured":"Kopelowitz, T., Krauthgamer, R., Porat, E., Solomon, S.: Orienting fully dynamic graphs with worst-case time bounds. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 532\u2013543. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_45"},{"issue":"5","key":"1_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ipl.2006.12.006","volume":"102","author":"L Kowalik","year":"2007","unstructured":"Kowalik, L.: Adjacency queries in dynamic sparse graphs. Inf. Process. Lett. 102(5), 191\u2013195 (2007)","journal-title":"Inf. Process. Lett."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"CSJA Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"CSJA Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39(1), 12 (1964)","journal-title":"J. Lond. Math. Soc."},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/S0097539705447256","volume":"35","author":"M Patrascu","year":"2006","unstructured":"Patrascu, M., Demaine, E.D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35(4), 932\u2013963 (2006)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/moor.10.4.701","volume":"10","author":"J Roskind","year":"1985","unstructured":"Roskind, J., Tarjan, R.E.: A note on finding minimum-cost edge-disjoint spanning trees. Math. Oper. Res. 10(4), 701\u2013708 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"WT Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. 36, 221\u2013230 (1961)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:04:31Z","timestamp":1709820271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}