Bast, Holger; Mehlhorn, Kurt; Schafer, Guido; Tamaki, Hisao Matching algorithms are fast in sparse random graphs. (English) Zbl 1104.68078 Theory Comput. Syst. 39, No. 1, 3-14 (2006). MSC: 68R10 05C70 05C80 05C85 68Q25 68W05 PDFBibTeX XMLCite \textit{H. Bast} et al., Theory Comput. Syst. 39, No. 1, 3--14 (2006; Zbl 1104.68078) Full Text: DOI Link
Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao Matching algorithms are fast in sparse random graphs. (English) Zbl 1122.68747 Diekert, Volker (ed.) et al., STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21236-1/pbk). Lecture Notes in Computer Science 2996, 81-92 (2004). MSC: 68W40 05C85 PDFBibTeX XMLCite \textit{H. Bast} et al., Lect. Notes Comput. Sci. 2996, 81--92 (2004; Zbl 1122.68747) Full Text: DOI
Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao A heuristic for Dijkstra’s algorithm with many targets and its use in weighted matching algorithms. (English) Zbl 1045.68148 Algorithmica 36, No. 1, 75-88 (2003). MSC: 68W05 PDFBibTeX XMLCite \textit{H. Bast} et al., Algorithmica 36, No. 1, 75--88 (2003; Zbl 1045.68148) Full Text: DOI
Mehlhorn, Kurt; Schäfer, Guido Implementation of \(O(nm\log n)\) weighted matchings in general graphs: the power of data structures. (English) Zbl 1083.68650 ACM J. Exp. Algorithm. 7, Spec. Iss., Article 4, 19 p. (2002). MSC: 68W40 05C85 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{G. Schäfer}, ACM J. Exp. Algorithm. 7, Article 4, 19 p. (2002; Zbl 1083.68650) Full Text: DOI Link
Mehlhorn, Kurt; Schäfer, Guido A heuristic for Dijkstra’s algorithm with many targets and its use in weighted matching algorithms. (English) Zbl 1007.68520 Meyer auf der Heide, Friedhelm (ed.), Algorithms - ESA 2001. 9th annual European symposium, Århus, Denmark, August 28-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2161, 242-253 (2001). MSC: 68R10 68T20 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{G. Schäfer}, Lect. Notes Comput. Sci. 2161, 242--253 (2001; Zbl 1007.68520)