@book{AMO93,
	author = {R. K. Ahuja, T. L. Magnanti, and J. B. Orlin},
	title = {Network Flows: Theory, Algorithms, and Applications},
	publisher = {Prentice Hall},
	year = {1993},
	address = {New York}
	}

@article{AMOT90,
 author = {Ravindra K. Ahuja and Kurt Mehlhorn and James Orlin and Robert E. Tarjan},
 title = {Faster algorithms for the shortest path problem},
 journal = {Journal of the ACM},
 volume = {37},
 number = {2},
 year = {1990},
 issn = {0004-5411},
 pages = {213--223},
 doi = {http://doi.acm.org/10.1145/77600.77615},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{AGM97,
 author = {Alon, Noga and Galil, Zvi and Margalit, Oded},
 title = {On the exponent of the all pairs shortest path problem},
 journal = {J. Comput. Syst. Sci.},
 volume = {54},
 number = {2},
 year = {1997},
 issn = {0022-0000},
 pages = {255--262},
 doi = {http://dx.doi.org/10.1006/jcss.1997.1388},
 publisher = {Academic Press, Inc.},
 address = {Orlando, FL, USA},
 }


@article{Bel58,
	author = {R. E. Bellman},
	title = {On a Routing Problem},
	journal = {Quarterly of Applied Mathematics},
	year = {1958},
	volume = {16},
	pages = {87-90}
	}

@inproceedings{BKRW98,
 author = {Buchsbaum, Adam L. and Kaplan, Haim and Rogers, Anne and Westbrook, Jeffery R.},
 title = {Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators},
 booktitle = {Proceedings of the thirtieth annual ACM symposium on Theory of computing},
 series = {STOC '98},
 year = {1998},
 isbn = {0-89791-962-9},
 location = {Dallas, Texas, United States},
 pages = {279--288},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/276698.276764},
 doi = {http://doi.acm.org/10.1145/276698.276764},
 acmid = {276764},
 publisher = {ACM},
 address = {New York, NY, USA},
} 


@article{Bor26,
	author = {Bor\r{u}vka, O.},
	title = {O jistém problému minimálním},
	journal = {Práce Moravské P\u{r}trodov\u{e}decké Spole\u{c}nosti v Brn\u{e}},
	year = {1926},
	volume = {3},
	pages = {37--58}
}

@inproceedings{Cha06,
 author = {Timothy M. Chan},
 title = {All-pairs shortest paths for unweighted undirected graphs in o(mn) time},
 booktitle = {SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm},
 year = {2006},
 isbn = {0-89871-605-5},
 pages = {514--523},
 location = {Miami, Florida},
 doi = {http://doi.acm.org/10.1145/1109557.1109614},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@inproceedings{Cha07,
 author = {Timothy M. Chan},
 title = {More algorithms for all-pairs shortest paths in weighted graphs},
 booktitle = {STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing},
 year = {2007},
 isbn = {978-1-59593-631-8},
 pages = {590--598},
 location = {San Diego, California, USA},
 doi = {http://doi.acm.org/10.1145/1250790.1250877},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@inproceedings{CW87,
 author = {D. Coppersmith and S. Winograd},
 title = {Matrix multiplication via arithmetic progressions},
 booktitle = {STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing},
 year = {1987},
 isbn = {0-89791-221-7},
 pages = {1--6},
 location = {New York, New York, United States},
 doi = {http://doi.acm.org/10.1145/28395.28396},
 publisher = {ACM},
 address = {New York, NY, USA},
 }



@inproceedings{CMUS98,
 author = {Andreas Crauser  and Kurt Mehlhorn and Ulrich Meyer and Peter Sanders},
 title = {A Parallelization of Dijkstra's Shortest Path Algorithm},
 booktitle = {MFCS '98: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science},
 year = {1998},
 isbn = {3-540-64827-5},
 pages = {722--731},
 publisher = {Springer-Verlag},
 address = {London, UK},
 }

@book{CLRS01,
 author = {T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein},
 title = {Introduction to algorithms},
 year = {2001},
 isbn = {0-262-03293-7},
 publisher = {MIT Press},
 address = {Cambridge, MA, USA},
 }

@INPROCEEDINGS{CZF04,
    author = {Deepayan Chakrabarti and Yiping Zhan and Christos Faloutsos},
    title = "{R-MAT: A recursive model for graph mining}",
    booktitle = {Proc. 4th SIAM Intl. Conf. on Data Mining},
    year = {2004}
}

@INPROCEEDINGS{DI01,
    author = {C. Demetrescu and G. F. Italiano},
    title = {Fully Dynamic All Pairs Shortest Paths with Real Edge Weights},
    booktitle = {In IEEE Symposium on Foundations of Computer Science},
    year = {2001},
    pages = {260--267}
}

@MISC{DGJ05,
    author = {C. Demetrescu and A.V. Goldberg and D. Johnson},
    title = {9th DIMACS Implementation Challenge - Shortest Paths},
    year = {2005},
	 HOWPUBLISHED = {\url{http://www.dis.uniroma1.it/~challenge9/}}
}

@article{Di69,
 author = {Dial, Robert B.},
 title = {Algorithm 360: shortest-path forest with topological ordering [H]},
 journal = {Commun. ACM},
 volume = {12},
 number = {11},
 year = {1969},
 issn = {0001-0782},
 pages = {632--633},
 doi = {http://doi.acm.org/10.1145/363269.363610},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{DGST88,
 author = {James R. Driscoll and Harold N. Gabow and Ruth Shrairman and Robert E. Tarjan},
 title = {Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation},
 journal = {Commun. ACM},
 volume = {31},
 number = {11},
 year = {1988},
 issn = {0001-0782},
 pages = {1343--1354},
 doi = {http://doi.acm.org/10.1145/50087.50096},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{Dij59,
author = {{E.W} Dijkstra},
title = {A note on two problems in connection with graphs},
journal = {Numerische Mathematik},
volume = {1},
year = {1959},
pages = {269--271} 
}

@article{DP84,
author = {N. Deo and {C.Y} Pang},
title = {Shortest path algorithms: a taxonomy and annotation},
journal = {Networks},
volume = {14},
pages = {275--323},
year = {1984} 
}

@article{DRT92,
 author = {Dixon, Brandon and Rauch, Monika and Tarjan, Robert E.},
 title = {Verification and sensitivity analysis of minimum spanning trees in linear time},
 journal = {SIAM J. Comput.},
 volume = {21},
 number = {6},
 year = {1992},
 issn = {0097-5397},
 pages = {1184--1192},
 doi = {http://dx.doi.org/10.1137/0221070},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }


@article{Flo62,
 author = {Floyd, Robert W.},
 title = {Algorithm 97: Shortest path},
 journal = {Commun. ACM},
 volume = {5},
 number = {6},
 year = {1962},
 issn = {0001-0782},
 pages = {345},
 doi = {http://doi.acm.org/10.1145/367766.368168},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{Fre87,
 author = {Frederickson, Greg N.},
 title = {Fast algorithms for shortest paths in planar graphs, with applications},
 journal = {SIAM J. Comput.},
 volume = {16},
 number = {6},
 year = {1987},
 issn = {0097-5397},
 pages = {1004--1022},
 doi = {http://dx.doi.org/10.1137/0216064},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }


@article{FT87,
 author = {Michael L. Fredman and Robert Endre Tarjan},
 title = {Fibonacci heaps and their uses in improved network optimization algorithms},
 journal = {J. ACM},
 volume = {34},
 number = {3},
 year = {1987},
 issn = {0004-5411},
 pages = {596--615},
 doi = {http://doi.acm.org/10.1145/28869.28874},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{FW94,
 author = {Michael L. Fredman and Dan E. Willard},
 title = {Trans-dichotomous algorithms for minimum spanning trees and shortest paths},
 journal = {J. Comput. Syst. Sci.},
 volume = {48},
 number = {3},
 year = {1994},
 issn = {0022-0000},
 pages = {533--551},
 doi = {http://dx.doi.org/10.1016/S0022-0000(05)80064-9},
 publisher = {Academic Press, Inc.},
 address = {Orlando, FL, USA},
 }

@article{GM97,
 author = {Z. Galil and O. Margalit},
 title = {All pairs shortest paths for graphs with small integer length edges},
 journal = {J. Comput. Syst. Sci.},
 volume = {54},
 number = {2},
 year = {1997},
 issn = {0022-0000},
 pages = {243--254},
 doi = {http://dx.doi.org/10.1006/jcss.1997.1385},
 publisher = {Academic Press, Inc.},
 address = {Orlando, FL, USA},
 }


@MISC{Gol,
    author = {A.V. Goldberg},
    title = {Network optimization library},
	 HOWPUBLISHED = {\url{http://www.avglab.com/andrew/soft.html}}
}

@inproceedings{Gol93,
 author = {A. V. Goldberg},
 title = {Scaling algorithms for the shortest paths problem},
 booktitle = {SODA '93: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms},
 year = {1993},
 pages = {222--231},
 location = {Austin, Texas, United States},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }

@inproceedings{Gol01a,
 author = {Andrew V. Goldberg},
 title = {A Simple Shortest Path Algorithm with Linear Average Time},
 booktitle = {ESA},
 year = {2001},
 isbn = {3-540-42493-8},
 pages = {230--241},
 publisher = {Springer-Verlag},
 address = {London, UK}
 }

@inproceedings{Gol01,
 author = {Goldberg, Andrew V.},
 title = {A Simple Shortest Path Algorithm with Linear Average Time},
 booktitle = {ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms},
 year = {2001},
 isbn = {3-540-42493-8},
 pages = {230--241},
 publisher = {Springer-Verlag},
 address = {London, UK},
 }

@article{Hag10,
 author = {Hagerup, Torben},
 title = {An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees},
 book = {Graph-Theoretic Concepts in Computer Science: 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
 year = {2010},
 isbn = {978-3-642-11408-3},
 pages = {178--189},
 doi = {http://dx.doi.org/10.1007/978-3-642-11409-0_16},
 publisher = {Springer-Verlag},
 address = {Berlin, Heidelberg},
 }


@article{Han04,
 author = {Y. Han},
 title = {Improved algorithm for all pairs shortest paths},
 journal = {Inf. Process. Lett.},
 volume = {91},
 number = {5},
 year = {2004},
 issn = {0020-0190},
 pages = {245--250},
 doi = {http://dx.doi.org/10.1016/j.ipl.2004.05.006},
 publisher = {Elsevier North-Holland, Inc.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 }

@inproceedings{Han06,
 author = {Y. Han},
 title = "{An $O(n^3 (\log\log n/\log n)^{5/4})$ time algorithm for all pairs shortest paths}",
 booktitle = {ESA'06: Proceedings of the 14th conference on Annual European Symposium},
 year = {2006},
 isbn = {3-540-38875-3},
 pages = {411--417},
 location = {Zurich, Switzerland},
 doi = {http://dx.doi.org/10.1007/11841036_38},
 publisher = {Springer-Verlag},
 address = {London, UK},
 }

@article{Joh77,
 author = {D. B. Johnson},
 title = {Efficient Algorithms for Shortest Paths in Sparse Networks},
 journal = {J. ACM},
 volume = {24},
 number = {1},
 year = {1977},
 issn = {0004-5411},
 pages = {1--13},
 doi = {http://doi.acm.org/10.1145/321992.321993},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{Joh82,
 author = {D. B. Johnson},
 title = "{A priority queue in which initialization and queue operations take O(1og log D) time}",
 journal = {Math Systems Theory},
 volume = {15},
 pages = {295--309},
 year = {1982}
}

@inproceedings{Kar94,
 author = {Karger, David R.},
 title = {Random sampling in cut, flow, and network design problems},
 booktitle = {STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing},
 year = {1994},
 isbn = {0-89791-663-8},
 pages = {648--657},
 location = {Montreal, Quebec, Canada},
 doi = {http://doi.acm.org/10.1145/195058.195422},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@inproceedings{King95,
 author = {King, Valerie},
 title = {A Simpler Minimum Spanning Tree Verification Algorithm},
 booktitle = {WADS '95: Proceedings of the 4th International Workshop on Algorithms and Data Structures},
 year = {1995},
 isbn = {3-540-60220-8},
 pages = {440--448},
 publisher = {Springer-Verlag},
 address = {London, UK},
 }

@inproceedings{KK06,
 author = {Korman, Amos and Kutten, Shay},
 title = {Distributed verification of minimum spanning trees},
 booktitle = {Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing},
 series = {PODC '06},
 year = {2006},
 isbn = {1-59593-384-0},
 location = {Denver, Colorado, USA},
 pages = {26--34},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/1146381.1146389},
 doi = {http://doi.acm.org/10.1145/1146381.1146389},
 acmid = {1146389},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {distributed algorithms, graph property verification, labeling schemes, minimum spanning tree, network algorithms, proof labeling, self stabilization},
} 


@article{KKT95,
 author = {Karger, David R. and Klein, Philip N. and Tarjan, Robert E.},
 title = {A randomized linear-time algorithm to find minimum spanning trees},
 journal = {J. ACM},
 volume = {42},
 number = {2},
 year = {1995},
 issn = {0004-5411},
 pages = {321--328},
 doi = {http://doi.acm.org/10.1145/201019.201022},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article {Kolmo09,
   author = {Kolmogorov, Vladimir},
   affiliation = {University College London London UK},
   title = {Blossom V: a new implementation of a minimum cost perfect matching algorithm},
   journal = {Mathematical Programming Computation},
   publisher = {Springer Berlin / Heidelberg},
   issn = {1867-2949},
   keyword = {Mathematics},
   pages = {43-67},
   volume = {1},
   issue = {1},
   url = {http://dx.doi.org/10.1007/s12532-009-0002-8},
   note = {10.1007/s12532-009-0002-8},
   year = {2009}
}

@inproceedings{Kom84,
 author = {Komlos, J.},
 title = {Linear Verification For Spanning Trees},
 booktitle = {SFCS '84: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984},
 year = {1984},
 isbn = {0-8186-0591-X},
 pages = {201--206},
 doi = {http://dx.doi.org/10.1109/SFCS.1984.715916},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
 }

@article{KPRS97,
 author = {King, Valerie and Poon, Chung Keung and Ramachandran, Vijaya and Sinha, Santanu},
 title = {An optimal {EREW} {PRAM} algorithm for minimum spanning tree verification},
 journal = {Inf. Process. Lett.},
 volume = {62},
 issue = {3},
 month = {May},
 year = {1997},
 issn = {0020-0190},
 pages = {153--159},
 numpages = {7},
 url = {http://portal.acm.org/citation.cfm?id=259708.259739},
 doi = {10.1016/S0020-0190(97)00050-1},
 acmid = {259739},
 publisher = {Elsevier North-Holland, Inc.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 keywords = {EREW PRAM, design of algorithms, minimum spanning tree verification, optimal algorithm, parallel algorithms},
} 

@inproceedings{KRRS94,
 author = {Klein, Philip and Rao, Satish and Rauch, Monika and Subramanian, Sairam},
 title = {Faster shortest-path algorithms for planar graphs},
 booktitle = {STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing},
 year = {1994},
 isbn = {0-89791-663-8},
 pages = {27--37},
 location = {Montreal, Quebec, Canada},
 doi = {http://doi.acm.org/10.1145/195058.195092},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{Kru56,
	author = {Joseph. B. Kruskal},
	title = {On the shortest spanning subtree of a graph and the traveling salesman problem},
	journal = {Proceedings of the American Mathematical Society},
	volume = {7},
	pages = {48--50},
	year = {1956},
}

@book{Law76,
 author = {E. L. Lawler},
 title = "{Combinatorial Optimization:  Networks and Matrioids}",
 publisher = {Holt, Rinehart and Winston},
 year = {1976},
 address = {New York}
 }

@MISC{MPSS01,
    author = {Kurt Mehlhorn and Volker Priebe and Guido Schäfer and Naveen Sivadasan},
    title = {All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles},
    year = {2001}
}

@book{MR95,
 author = {Motwani, Rajeev and Raghavan, Prabhakar},
 title = {Randomized algorithms},
 year = {1995},
 isbn = {0-521-47465-5},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
 }


@article{OMSW2010,
 author = {Orlin, James B. and Madduri, Kamesh and Subramani, K. and Williamson, M.},
 title = {A faster algorithm for the single source shortest path problem with few distinct positive lengths},
 journal = {J. of Discrete Algorithms},
 volume = {8},
 number = {2},
 year = {2010},
 issn = {1570-8667},
 pages = {189--198},
 doi = {http://dx.doi.org/10.1016/j.jda.2009.03.001},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 }

@book{Pap94,
	author = {Christos H. Papadimitriou},
	title = {Computational Complexity},
	publisher = {Addison-Wesley},
	year = {1994},
	address = {New York}
	}

@article{PR05,
 author = {Pettie, Seth and Ramachandran, Vijaya},
 title = {A Shortest Path Algorithm for  Real-Weighted Undirected Graphs},
 journal = {SIAM J. Comput.},
 volume = {34},
 number = {6},
 year = {2005},
 issn = {0097-5397},
 pages = {1398--1431},
 doi = {http://dx.doi.org/10.1137/S0097539702419650},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }

@article{Pet04,
 author = {Pettie, Seth},
 title = {A new approach to all-pairs shortest paths on real-weighted graphs},
 journal = {Theor. Comput. Sci.},
 volume = {312},
 number = {1},
 year = {2004},
 issn = {0304-3975},
 pages = {47--74},
 doi = {http://dx.doi.org/10.1016/S0304-3975(03)00402-X},
 publisher = {Elsevier Science Publishers Ltd.},
 address = {Essex, UK},
 }

@INPROCEEDINGS{Pet02,
    author = {Pettie, Seth},
    title = {A Faster All-pairs Shortest Path Algorithm for Real-weighted Sparse Graphs},
    booktitle = {In Proc. 29th Int'l Colloq. on Automata, Languages, and Programming (ICALP'02), LNCS},
    year = {2002},
    pages = {85--97},
    publisher = {Springer}
}

@article{Pet06,
 author       = {Seth Pettie},
 title        = {An Inverse-{A}ckermann Type Lower Bound for Online
                 Minimum Spanning Tree Verification},
 journal      = {Combinatorica},
 volume       = {26},
 number       = {2},
 pages        = {207--230},
 year         = {2006},
}

@article{PR02,
 author = {Seth Pettie and Vijaya Ramachandran},
 title= {An optimal minimum spanning tree algorithm},
 journal = {J. {ACM}},
 volume = {49},
 number = {1},
 year = {2002},
 pages = {16--34},
}

@article{Prim57,
	author = {R.C. Prim},
	title = {Shortest connection networks and some generalizations},
	journal = {Bell Sys. Tech. Journal},
	volume = {36},
	year = {1957},
	pages = {1389–-1401},
}


@inproceedings{Sei92,
 author = {Seidel, Raimund},
 title = {On the all-pairs-shortest-path problem},
 booktitle = {STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing},
 year = {1992},
 isbn = {0-89791-511-9},
 pages = {745--749},
 location = {Victoria, British Columbia, Canada},
 doi = {http://doi.acm.org/10.1145/129712.129784},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{Sub09,
 author = {Subramani, K.},
 title = {Optimal Length Resolution Refutations of Difference Constraint Systems},
 journal = {J. Autom. Reason.},
 volume = {43},
 number = {2},
 year = {2009},
 issn = {0168-7433},
 pages = {121--137},
 doi = {http://dx.doi.org/10.1007/s10817-009-9139-4},
 publisher = {Kluwer Academic Publishers},
 address = {Hingham, MA, USA},
 }

@article{SV88,
 author = {Schieber, Baruch and Vishkin, Uzi},
 title = {On finding lowest common ancestors: simplification and parallelization},
 journal = {SIAM J. Comput.},
 volume = {17},
 number = {6},
 year = {1988},
 issn = {0097-5397},
 pages = {1253--1262},
 doi = {http://dx.doi.org/10.1137/0217079},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }

@INPROCEEDINGS{SZ99,
    author = {Avi Shoshan and Uri Zwick},
    title = {All Pairs Shortest Paths in Undirected Graphs with Integer Weights},
    booktitle = {In IEEE Symposium on Foundations of Computer Science},
    year = {1999},
    pages = {605--614}
}

@article{Tar82,
 author = {Robert Endre Tarjan},
 title = {Sensitivity analysis of minimum spanning trees and shortest path trees},
 journal = {Information Processing Letters},
 volume = {14},
 number = {1},
 year = {1982},
 pages = {30--33}
}

@article{TE79,
 author = {Tarjan, Robert Endre},
 title = {Applications of Path Compression on Balanced Trees},
 journal = {J. ACM},
 volume = {26},
 number = {4},
 year = {1979},
 issn = {0004-5411},
 pages = {690--715},
 doi = {http://doi.acm.org/10.1145/322154.322161},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@inproceedings{Tho97,
 author = {M. Thorup},
 title = {Undirected single source shortest paths in linear time},
 booktitle = {FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97)},
 year = {October 20–-22 1997},
 isbn = {0-8186-8197-7},
 pages = {12--21},
 publisher = {IEEE Computer Society},
 address = {Los Alamitos},
 }

@inproceedings{Zwi98,
 author = {U. Zwick},
 title = {All Pairs Shortest Paths in weighted directed graphs - exact and almost exact algorithms},
 booktitle = {FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science},
 year = {1998},
 isbn = {0-8186-9172-7},
 pages = {310},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
 }