Gabow, Harold N.; Sankowski, Piotr Algorithms for weighted matching generalizations. II: \(f\)-factors and the special case of shortest paths. (English) Zbl 1461.05212 SIAM J. Comput. 50, No. 2, 555-601 (2021). MSC: 05C85 68W05 68W20 PDFBibTeX XMLCite \textit{H. N. Gabow} and \textit{P. Sankowski}, SIAM J. Comput. 50, No. 2, 555--601 (2021; Zbl 1461.05212) Full Text: DOI
Gabow, Harold N.; Sankowski, Piotr Algorithms for weighted matching generalizations. I: Bipartite graphs, \(b\)-matching, and unweighted \(f\)-factors. (English) Zbl 1461.05211 SIAM J. Comput. 50, No. 2, 440-486 (2021). MSC: 05C85 68W05 68W20 PDFBibTeX XMLCite \textit{H. N. Gabow} and \textit{P. Sankowski}, SIAM J. Comput. 50, No. 2, 440--486 (2021; Zbl 1461.05211) Full Text: DOI
Cygan, Marek; Gabow, Harold N.; Sankowski, Piotr Algorithmic applications of Baur-Strassen’s theorem, shortest cycles, diameter, and matchings. (English) Zbl 1426.05164 J. ACM 62, No. 4, Article No. 28, 30 p. (2015). MSC: 05C85 05C22 05C38 05C50 05C70 68Q25 90C35 PDFBibTeX XMLCite \textit{M. Cygan} et al., J. ACM 62, No. 4, Article No. 28, 30 p. (2015; Zbl 1426.05164) Full Text: DOI arXiv
Chang, Jessica; Gabow, Harold N.; Khuller, Samir A model for minimizing active processor time. (English) Zbl 1314.68085 Algorithmica 70, No. 3, 368-405 (2014). MSC: 68M20 05C70 05C85 90B35 PDFBibTeX XMLCite \textit{J. Chang} et al., Algorithmica 70, No. 3, 368--405 (2014; Zbl 1314.68085) Full Text: DOI arXiv
Gabow, Harold N.; Kaplan, Haim; Tarjan, Robert E. Unique maximum matching algorithms. (English) Zbl 0982.05094 J. Algorithms 40, No. 2, 159-183 (2001). MSC: 05C85 05C70 68W05 68R10 PDFBibTeX XMLCite \textit{H. N. Gabow} et al., J. Algorithms 40, No. 2, 159--183 (2001; Zbl 0982.05094) Full Text: DOI Link