{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:07Z","timestamp":1725795907461},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_12","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"138-149","source":"Crossref","is-referenced-by-count":6,"title":["Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs"],"prefix":"10.1007","author":[{"given":"Surender","family":"Baswana","sequence":"first","affiliation":[]},{"given":"Shahbaz","family":"Khan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45022-X_8","volume-title":"Automata, Languages and Programming","author":"S. Alstrup","year":"2000","unstructured":"Alstrup, S., Holm, J.: Improved algorithms for finding level ancestors in dynamic trees. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 73\u201384. Springer, Heidelberg (2000)"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1137\/S0097539700370539","volume":"34","author":"R. Cole","year":"2005","unstructured":"Cole, R., Hariharan, R.: Dynamic lca queries on trees. SIAM J. Comput.\u00a034(4), 894\u2013923 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322234.322235","volume":"28","author":"S. Even","year":"1981","unstructured":"Even, S., Shiloach, Y.: An on-line edge-deletion problem. J. ACM\u00a028(1), 1\u20134 (1981)","journal-title":"J. ACM"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0020-0190(96)00202-5","volume":"61","author":"P.G. Franciosa","year":"1997","unstructured":"Franciosa, P.G., Gambosi, G., Nanni, U.: The incremental maintenance of a depth-first-search tree in directed acyclic graphs. Inf. Process. Lett.\u00a061(2), 113\u2013120 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(94)90159-7","volume":"130","author":"P.B. Miltersen","year":"1994","unstructured":"Miltersen, P.B., Subramanian, S., Vitter, J.S., Tamassia, R.: Complexity models for incremental computation. Theor. Comput. Sci.\u00a0130(1), 203\u2013236 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"J.H. Reif","year":"1985","unstructured":"Reif, J.H.: Depth-first search is inherently sequential. Inf. Process. Lett.\u00a020(5), 229\u2013234 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0020-0190(87)90095-0","volume":"25","author":"J.H. Reif","year":"1987","unstructured":"Reif, J.H.: A topological approach to dynamic graph connectivity. Inf. Process. Lett.\u00a025(1), 65\u201370 (1987)","journal-title":"Inf. Process. Lett."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-3-540-30140-0_52","volume-title":"Algorithms \u2013 ESA 2004","author":"L. Roditty","year":"2004","unstructured":"Roditty, L., Zwick, U.: On dynamic shortest paths problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 580\u2013591. Springer, Heidelberg (2004)"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:11:55Z","timestamp":1558923115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}