Cesty: Algoritmy pro PPSP (obousmerny Dijkstra, A*)

[ga.git] / ga.bib

diff --git a/ga.bib b/ga.bib
index 31c389af9e0a246c608e5f3350be159ca517964b..edac83d04674e48ed81a8120d54e0b06ef6ece37 100644 (file)
--- a/ga.bib
+++ b/ga.bib
@@ -451,7 +451,7 @@
 }
 
 @article{ weihe:paths,
-  title={{Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time}},
+  title={{Edge-Disjoint $(s,t)$-Paths in Undirected Planar Graphs in Linear Time}},
   author={Weihe, K.},
   journal={Journal of Algorithms},
   volume={23},
@@ -460,3 +460,76 @@
   year={1997},
   publisher={Elsevier}
 }
+
+@article{ threeinds,
+  title={{An $\O({\vert V\vert}^3)$ algorithm for finding maximum flows in networks}},
+  author={Malhotra, V. and Kumar, M.P. and Maheshwari, S.N.},
+  journal={Information Processing Letters},
+  volume={7},
+  number={6},
+  pages={277--278},
+  year={1978}
+}
+
+@article{ ahomcc,
+  title={{Efficient string matching: an aid to bibliographic search}},
+  author={Aho, A.V. and Corasick, M.J.},
+  journal={Communications of the ACM},
+  volume={18},
+  number={6},
+  pages={333--340},
+  year={1975},
+  publisher={ACM Press New York, NY, USA}
+}
+
+@article{ hopcroft:matching,
+  title={{An $n^{5/2}$ algorithm for maximum matchings in bipartite graphs}},
+  author={Hopcroft, J.E. and Karp, R.M.},
+  journal={SIAM Journal on Computing},
+  volume={2},
+  number={4},
+  pages={225--231},
+  year={1973}
+}
+
+@article{ karger:mincut,
+ author = {Karger, David R. and Stein, Clifford},
+ title = {A new approach to the minimum cut problem},
+ journal = {J. ACM},
+ volume = {43},
+ number = {4},
+ year = {1996},
+ issn = {0004-5411},
+ pages = {601--640},
+ doi = {http://doi.acm.org/10.1145/234533.234534},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+}
+
+@inproceedings{ thorup:queue,
+  title={{Integer priority queues with decrease key in constant time and the single source shortest paths problem}},
+  author={Thorup, M.},
+  booktitle={Proceedings of the thirty-fifth annual ACM symposium on Theory of computing},
+  pages={149--158},
+  year={2003},
+}
+
+@article{ thorup:equiv,
+  title={{Equivalence between priority queues and sorting}},
+  author={Thorup, M.},
+  journal={Journal of the ACM},
+  volume={54},
+  number={6},
+  pages={28},
+  year={2007},
+  publisher={ACM}
+}
+
+@conference{ cherkassky:hotq,
+  title={{Buckets, heaps, lists, and monotone priority queues}},
+  author={Cherkassky, B.V. and Goldberg, A.V. and Silverstein, C.},
+  booktitle={Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms},
+  pages={83--92},
+  year={1997},
+  organization={Society for Industrial and Applied Mathematics}
+}