Alt, H.; Blum, N.; Mehlhorn, K.; Paul, M. Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\). (English) Zbl 0714.68036 Inf. Process. Lett. 37, No. 4, 237-240 (1991). MSC: 68Q25 68R10 05C70 PDFBibTeX XMLCite \textit{H. Alt} et al., Inf. Process. Lett. 37, No. 4, 237--240 (1991; Zbl 0714.68036) Full Text: DOI
Blum, Norbert; Mehlhorn, Kurt On the average number of rebalancing operations in weight-balanced trees. (English) Zbl 0435.68051 Theor. Comput. Sci. 11, 303-320 (1980). MSC: 68R10 68P20 PDFBibTeX XMLCite \textit{N. Blum} and \textit{K. Mehlhorn}, Theor. Comput. Sci. 11, 303--320 (1980; Zbl 0435.68051) Full Text: DOI DOI
Blum, Norbert; Mehlhorn, Kurt Average number of rebalancing operations in weight-balanced trees. (Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.) (German) Zbl 0399.05022 Theor. Comput. Sci., 4th GI Conf., Aachen, 1979. Lect. Notes Comput. Sci. 67, 67-78 (1979). MSC: 05C05 68R10 PDFBibTeX XML