Johnson, Donald B.; Metaxas, Panagiotis A parallel algorithm for computing minimum spanning trees. (English) Zbl 0836.68083 J. Algorithms 19, No. 3, 383-401 (1995). MSC: 68R10 68W15 68Q25 68Q05 05C40 PDF BibTeX XML Cite \textit{D. B. Johnson} and \textit{P. Metaxas}, J. Algorithms 19, No. 3, 383--401 (1995; Zbl 0836.68083) Full Text: DOI
Hassin, Refael; Johnson, Donald B. An O(n \(\log ^ 2n)\) algorithm for maximum flow in undirected planar networks. (English) Zbl 0565.90018 SIAM J. Comput. 14, 612-624 (1985). MSC: 90B10 05C35 68Q25 90C35 65K05 PDF BibTeX XML Cite \textit{R. Hassin} and \textit{D. B. Johnson}, SIAM J. Comput. 14, 612--624 (1985; Zbl 0565.90018) Full Text: DOI
Frederickson, Greg N.; Johnson, Donald B. Finding kth paths and p-centers by generating and searching good data structures. (English) Zbl 0509.68057 J. Algorithms 4, 61-80 (1983). MSC: 68R10 05C05 68P10 68P05 68W99 PDF BibTeX XML Cite \textit{G. N. Frederickson} and \textit{D. B. Johnson}, J. Algorithms 4, 61--80 (1983; Zbl 0509.68057) Full Text: DOI
Frederickson, Greg N.; Johnson, Donald B. Generating and searching sets induced by networks (preliminary version). (English) Zbl 0453.68034 Automata, languages and programming, 7th Colloq., Noordwijkerhout/ Netherlands 1980, Lect. Notes Comput. Sci. 85, 221-233 (1980). MSC: 68R10 05C05 68Q25 68P10 PDF BibTeX XML
Johnson, Donald B.; Miller, Webb; Minnihan, Brian; Wrathall, Celia Reducibility among floating-point graphs. (English) Zbl 0441.65034 J. Assoc. Comput. Mach. 26, 739-760 (1979). MSC: 65G50 05C50 65F30 68R10 65F05 PDF BibTeX XML Cite \textit{D. B. Johnson} et al., J. Assoc. Comput. Mach. 26, 739--760 (1979; Zbl 0441.65034) Full Text: DOI
Johnson, Donald B. Efficient algorithms for shortest paths in sparse networks. (English) Zbl 0343.68028 J. Assoc. Comput. Mach. 24, 1-13 (1977). MSC: 68Q25 68W99 68N01 05C20 PDF BibTeX XML Cite \textit{D. B. Johnson}, J. Assoc. Comput. Mach. 24, 1--13 (1977; Zbl 0343.68028) Full Text: DOI
Johnson, Donald B. Priority queues with update and finding minimum spanning trees. (English) Zbl 0318.68032 Inf. Process. Lett. 4, 53-57 (1975). MSC: 68W99 68W30 68Q25 68N01 68Q45 05C05 PDF BibTeX XML Cite \textit{D. B. Johnson}, Inf. Process. Lett. 4, 53--57 (1975; Zbl 0318.68032) Full Text: DOI
Johnson, Donald B. Finding all the elementary circuits of a directed graph. (English) Zbl 0275.05112 SIAM J. Comput. 4, 77-84 (1975). MSC: 05-04 05C35 05C20 PDF BibTeX XML Cite \textit{D. B. Johnson}, SIAM J. Comput. 4, 77--84 (1975; Zbl 0275.05112) Full Text: DOI