{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:35:45Z","timestamp":1742992545860,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664277"},{"type":"electronic","value":"9783540483182"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48318-7_12","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T20:20:56Z","timestamp":1193343656000},"page":"124-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA"],"prefix":"10.1007","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Zarafidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Zoura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"issue":"5","key":"12_CR1","first-page":"192","volume":"2","author":"D. Alberts","year":"1997","unstructured":"D. Alberts, G. Cattaneo and G. Italiano, \u201cAn Empirical Study of Dynamic Algorithms,\u201d ACM Journal of Experimental Algorithmics, Vol. 2, No. 5, pp. 192\u2013201, 1997.","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"12_CR2","unstructured":"G. Amato, G. Cattaneo and G. Italiano, \u201cExperimental Analysis of Dynamic Minimum Spanning Tree Algorithms,\u201d Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 314\u2013323, January 1997."},{"key":"12_CR3","unstructured":"G. Amato, G. Cattaneo, G. F. Italiano, U. Nanni and C. Zaroliagis, \u201cA Software Library of Dynamic Graph Algorithms,\u201d Proceedings of the Workshop on Algorithms and Experiments (ALEX\u201998), pp. 129\u2013136, February 1998."},{"key":"12_CR4","unstructured":"D. Alberts and M. Henzinger, \u201cAverage Case Analysis of Dynamic Graph Algorithms,\u201d Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 312\u2013321, 1995."},{"key":"12_CR5","unstructured":"Bela Bollobas, Random Graphs, Academic Press, 1985."},{"key":"12_CR6","unstructured":"T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, MIT Press\/McGraw-Hill Book company, 1990."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1996.0002","volume":"52","author":"D. Eppstein","year":"1996","unstructured":"D. Eppstein, Z. Galil, G. Italiano and T. Spencer, \u201cSeparator Based Sparsification for Dynamic Planar Graph Algorithms,\u201d Journal of Computer and System Science, Vol. 52, No. 1, pp. 3\u201327, 1996.","journal-title":"Journal of Computer and System Science"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D. Epstein","year":"1997","unstructured":"D. Epstein, Z. Galil, G. Italiano and A. Nissenweig, \u201cSparsification-A Technique for Speeding Up Dynamic Graph Algorithms,\u201d Journal of ACM, Vol. 44, pp. 669\u2013696, 1997.","journal-title":"Journal of ACM"},{"key":"12_CR9","first-page":"17","volume":"5","author":"P. Erdos","year":"1960","unstructured":"P. Erdos and A. Renyi, \u201cOn the evolution of random graphs,\u201d Magyar Tud. Akad. Math. Kut. Int. Kozl., 5, pp. 17\u201361, 1960.","journal-title":"Magyar Tud. Akad. Math. Kut. Int. Kozl."},{"key":"12_CR10","unstructured":"P. Fatourou, P. Spirakis, P. Zarafidis and A. Zoura, \u201cImplementation and Experimental Evaluation of Graph Connectivity Algorithms using LEDA,\u201d http:\/\/students.ceid.upatras.gr\/~faturu\/projects.htm"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"G. Frederickson","year":"1985","unstructured":"G. Frederickson, \u201cData Structures for On-Line Updating of Minimum Spanning Trees,\u201d SIAM Journal of Computing, Vol. 14, pp. 781\u2013798, 1985.","journal-title":"SIAM Journal of Computing"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"G. Frederickson, \u201cAmbivalent data structures for dynamic 2-edge connectivity and k-smallest spanning trees,\u201d Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FOCS\u201991), pp. 632\u2013641, 1991.","DOI":"10.1109\/SFCS.1991.185429"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Schaefer and C. Zaroliagis, \u201cAn Experimental Study of Dynamic Algorithms for Directed Graphs,\u201d Proceedings of the 6th Annual European Symposium on Algorithms (ESA\u201998), pp. 368\u2013380, August 1998.","DOI":"10.1007\/3-540-68530-8_31"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Z. Galil and G. Italiano, \u201cFully dynamic algorithms for edge-connectivity problems,\u201d Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC\u201991), pp. 317\u2013327, May 1991.","DOI":"10.1145\/103418.103454"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"M. Henzinger and V. King, \u201cRandomized Graph Algorithms with Polylogarithmic Time per Operation,\u201d Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC\u201995), pp. 519\u2013527, 1995.","DOI":"10.1145\/225058.225269"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(80)90017-6","volume":"1","author":"R. Karp","year":"1980","unstructured":"R. Karp and R. Tarjan, \u201cLinear Expected Time for Connectivity Problems,\u201d Journal of Algorithms, Vol. 1, pp. 374\u2013393, 1980.","journal-title":"Journal of Algorithms"},{"key":"12_CR17","unstructured":"\u201cLEDA Extension Package Dynamic Graph Algorithms\u201d, User Manual, Version 3.8, 1998."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn and S. Naher, \u201cLEDA, A platform for combinatorial and geometric computing \u201d Communications of the ACM, 1995.","DOI":"10.1145\/204865.204889"},{"key":"12_CR19","unstructured":"K. Mehlhorn and S. Naher, The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press, 1999."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"S. Nikoletseas, J. Reif, P. Spirakis and M. Yung, \u201cStochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time,\u201d Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP\u201995), pp. 159\u2013170, 1995.","DOI":"10.1007\/3-540-60084-1_71"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48318-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:28:58Z","timestamp":1737498538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48318-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664277","9783540483182"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48318-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}