%0 Conference Paper %1 conf/swat/Thorup04 %A Thorup, Mikkel %B SWAT %D 2004 %E Hagerup, Torben %E Katajainen, Jyrki %I Springer %K dblp %P 384-396 %T Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. %U http://dblp.uni-trier.de/db/conf/swat/swat2004.html#Thorup04 %V 3111 %@ 3-540-22339-8

@inproceedings{conf/swat/Thorup04, added-at = {2017-05-23T00:00:00.000+0200}, author = {Thorup, Mikkel}, biburl = {https://www.bibsonomy.org/bibtex/260af81163ec8c723de9c1ce011d4ff2d/dblp}, booktitle = {SWAT}, crossref = {conf/swat/2004}, editor = {Hagerup, Torben and Katajainen, Jyrki}, ee = {https://doi.org/10.1007/978-3-540-27810-8_33}, interhash = {3ae3842444d17e1692777cc5c9f875b0}, intrahash = {60af81163ec8c723de9c1ce011d4ff2d}, isbn = {3-540-22339-8}, keywords = {dblp}, pages = {384-396}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:45:54.000+0200}, title = {Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles.}, url = {http://dblp.uni-trier.de/db/conf/swat/swat2004.html#Thorup04}, volume = 3111, year = 2004 }