×

Found 5 Documents (Results 1–5)

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
Full Text: DOI

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

Filter Results by …

Document Type

Year of Publication

Main Field

Software