@article{ Eppstein1997,
  author = {Eppstein, David and Galil, Zvi and Italiano, Giuseppe F. and Nissenzweig, Amnon},
  doi = {10.1145/265910.265914},
  file = {:Users/KunihiroWASA/Dropbox/paper/1997/Eppstein et al., Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms, 1997.pdf:pdf},
  issn = {00045411},
  journal = {Journal of the ACM},
  keywords = {dynamic graph algorithms,edge and vertex connectivity,minimum spanning trees},
  month = {September},
  number = {5},
  pages = {669--696},
  publisher = {ACM},
  title = {{Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms}},
  url = {http://dl.acm.org/citation.cfm?id=265910.265914},
  volume = {44},
  year = {1997}
}

{"_id":"bjJmZfFtJspAsWFhx","authorIDs":[],"author_short":["Eppstein, D.","Galil, Z.","Italiano, G.<nbsp>F.","Nissenzweig, A."],"bibbaseid":"eppstein-galil-italiano-nissenzweig-sparsificationatechniqueforspeedingupdynamicgraphalgorithms-1997","bibdata":{"author":["Eppstein, David","Galil, Zvi","Italiano, Giuseppe F.","Nissenzweig, Amnon"],"author_short":["Eppstein, D.","Galil, Z.","Italiano, G.<nbsp>F.","Nissenzweig, A."],"bibtex":"@article{ Eppstein1997,\n author = {Eppstein, David and Galil, Zvi and Italiano, Giuseppe F. and Nissenzweig, Amnon},\n doi = {10.1145/265910.265914},\n file = {:Users/KunihiroWASA/Dropbox/paper/1997/Eppstein et al., Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms, 1997.pdf:pdf},\n issn = {00045411},\n journal = {Journal of the ACM},\n keywords = {dynamic graph algorithms,edge and vertex connectivity,minimum spanning trees},\n month = {September},\n number = {5},\n pages = {669--696},\n publisher = {ACM},\n title = {{Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms}},\n url = {http://dl.acm.org/citation.cfm?id=265910.265914},\n volume = {44},\n year = {1997}\n}","bibtype":"article","doi":"10.1145/265910.265914","file":":Users/KunihiroWASA/Dropbox/paper/1997/Eppstein et al., Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms, 1997.pdf:pdf","id":"Eppstein1997","issn":"00045411","journal":"Journal of the ACM","key":"Eppstein1997","keywords":"dynamic graph algorithms,edge and vertex connectivity,minimum spanning trees","month":"September","number":"5","pages":"669--696","publisher":"ACM","title":"Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms","type":"article","url":"http://dl.acm.org/citation.cfm?id=265910.265914","volume":"44","year":"1997","bibbaseid":"eppstein-galil-italiano-nissenzweig-sparsificationatechniqueforspeedingupdynamicgraphalgorithms-1997","role":"author","urls":{"Paper":"http://dl.acm.org/citation.cfm?id=265910.265914"},"keyword":["dynamic graph algorithms","edge and vertex connectivity","minimum spanning trees"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:44.479Z","downloads":0,"keywords":["dynamic graph algorithms","edge and vertex connectivity","minimum spanning trees"],"search_terms":["sparsification","technique","speeding","dynamic","graph","algorithms","eppstein","galil","italiano","nissenzweig"],"title":"Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms","year":1997,"dataSources":["YRMeqhMHoNu9HzJoC"]}