Schieber, Baruch Computing a minimum weight \(k\)-link path in graphs with the concave Monge property. (English) Zbl 0916.68066 J. Algorithms 29, No. 2, 204-222 (1998). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{B. Schieber}, J. Algorithms 29, No. 2, 204--222 (1998; Zbl 0916.68066) Full Text: DOI
Hambrusch, Susanne E.; Tu, Hung-Yi Edge weight reduction problems in directed acyclic graphs. (English) Zbl 0882.68105 J. Algorithms 24, No. 1, 66-93 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{S. E. Hambrusch} and \textit{H.-Y. Tu}, J. Algorithms 24, No. 1, 66--93 (1997; Zbl 0882.68105) Full Text: DOI Link
Chu, Jeff Optimal algorithm for the nearest common dominator problem. (English) Zbl 0768.68128 J. Algorithms 13, No. 4, 693-697 (1992). MSC: 68R10 05C20 05C85 05C38 PDFBibTeX XMLCite \textit{J. Chu}, J. Algorithms 13, No. 4, 693--697 (1992; Zbl 0768.68128) Full Text: DOI
Blumer, Janet A. How much is that DAWG in the window ? A moving window algorithm for the directed acyclic word graph. (English) Zbl 0636.68109 J. Algorithms 8, 451-469 (1987). MSC: 68Q45 68Q25 68P05 PDFBibTeX XMLCite \textit{J. A. Blumer}, J. Algorithms 8, 451--469 (1987; Zbl 0636.68109) Full Text: DOI