Feder, Tomás; Motwani, Rajeev; O’Callaghan, Liadan; Olston, Chris; Panigrahy, Rina Computing shortest paths with uncertainty. (English) Zbl 1115.68111 J. Algorithms 62, No. 1, 1-18 (2007). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{T. Feder} et al., J. Algorithms 62, No. 1, 1--18 (2007; Zbl 1115.68111) Full Text: DOI
Bender, Michael A.; Farach-Colton, Martín; Pemmasani, Giridhar; Skiena, Steven; Sumazin, Pavel Lowest common ancestors in trees and directed acyclic graphs. (English) Zbl 1085.68103 J. Algorithms 57, No. 2, 75-94 (2005). MSC: 68R10 05C05 05C20 05C85 PDFBibTeX XMLCite \textit{M. A. Bender} et al., J. Algorithms 57, No. 2, 75--94 (2005; Zbl 1085.68103) Full Text: DOI
Deng, Xiaotie; Li, Guojun; Zang, Wenan; Zhou, Yi A 2-approximation algorithm for path coloring on a restricted class of trees of rings. (English) Zbl 1045.68152 J. Algorithms 47, No. 1, 1-13 (2003). MSC: 68W05 68R10 PDFBibTeX XMLCite \textit{X. Deng} et al., J. Algorithms 47, No. 1, 1--13 (2003; Zbl 1045.68152) Full Text: DOI
Bazgan, Cristina; Santha, Miklos; Tuza, Zsolt On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. (English) Zbl 0919.05039 J. Algorithms 31, No. 1, 249-268 (1999). MSC: 05C45 68Q25 05C38 05C85 PDFBibTeX XMLCite \textit{C. Bazgan} et al., J. Algorithms 31, No. 1, 249--268 (1999; Zbl 0919.05039) Full Text: DOI Link
Babel, L.; Ponomarenko, I. N.; Tinhofer, G. The isomorphism problem for directed path graphs and for rooted directed path graphs. (English) Zbl 0864.68070 J. Algorithms 21, No. 3, 542-564 (1996). MSC: 68R10 PDFBibTeX XMLCite \textit{L. Babel} et al., J. Algorithms 21, No. 3, 542--564 (1996; Zbl 0864.68070) Full Text: DOI
Cohen, David; Fredman, Michael L. Weighted binary trees for concurrent searching. (English) Zbl 0840.68032 J. Algorithms 20, No. 1, 87-112 (1996). MSC: 68P10 68Q10 68R10 PDFBibTeX XMLCite \textit{D. Cohen} and \textit{M. L. Fredman}, J. Algorithms 20, No. 1, 87--112 (1996; Zbl 0840.68032) Full Text: DOI
Zhu, Xuding A polynomial algorithm for homomorphisms to oriented cycles. (English) Zbl 0836.68089 J. Algorithms 19, No. 3, 333-345 (1995). MSC: 68R10 68Q25 05C20 05C38 PDFBibTeX XMLCite \textit{X. Zhu}, J. Algorithms 19, No. 3, 333--345 (1995; Zbl 0836.68089) Full Text: DOI
Gavril, F.; Toledano Laredo, V.; de Werra, Dominique Chordless paths, odd holes, and kernels in graphs without \(m\)- obstructions. (English) Zbl 0807.05035 J. Algorithms 17, No. 2, 207-221 (1994). MSC: 05C20 68Q25 05C85 PDFBibTeX XMLCite \textit{F. Gavril} et al., J. Algorithms 17, No. 2, 207--221 (1994; Zbl 0807.05035) Full Text: DOI
Ibarra, Oscar H.; Zheng, Qi Some efficient algorithms for permutation graphs. (English) Zbl 0804.68102 J. Algorithms 16, No. 3, 453-469 (1994). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{O. H. Ibarra} and \textit{Q. Zheng}, J. Algorithms 16, No. 3, 453--469 (1994; Zbl 0804.68102) Full Text: DOI
Bodlaender, Hans L. On linear time minor tests with depth-first search. (English) Zbl 0764.68107 J. Algorithms 14, No. 1, 1-23 (1993). MSC: 68R10 68Q25 90C35 05C38 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, J. Algorithms 14, No. 1, 1--23 (1993; Zbl 0764.68107) Full Text: DOI
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
Bang-Jensen, Jørgen; Manoussakis, Yannis; Thomassen, Carsten A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs. (English) Zbl 0749.68057 J. Algorithms 13, No. 1, 114-127 (1992). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Algorithms 13, No. 1, 114--127 (1992; Zbl 0749.68057) Full Text: DOI
Ramarao, K. V. S.; Venkatesan, S. On finding and updating shortest paths distributively. (English) Zbl 0767.68062 J. Algorithms 13, No. 2, 235-257 (1992). MSC: 68Q25 68M10 68R10 PDFBibTeX XMLCite \textit{K. V. S. Ramarao} and \textit{S. Venkatesan}, J. Algorithms 13, No. 2, 235--257 (1992; Zbl 0767.68062) Full Text: DOI
Hershberger, John; Guibas, Leonidas J. An O(n 2) shortest path algorithm for a nonrotating convex body. (English) Zbl 0647.68048 J. Algorithms 9, No. 1, 18-46 (1988). MSC: 68Q25 52A10 PDFBibTeX XMLCite \textit{J. Hershberger} and \textit{L. J. Guibas}, J. Algorithms 9, No. 1, 18--46 (1988; Zbl 0647.68048) Full Text: DOI
Soroker, Danny Fats parallel algorithms for finding Hamiltonian paths and cycles in a tournament. (English) Zbl 0644.05036 J. Algorithms 9, No. 2, 276-286 (1988). Reviewer: J.Ebert MSC: 05C45 68R10 68Q25 PDFBibTeX XMLCite \textit{D. Soroker}, J. Algorithms 9, No. 2, 276--286 (1988; Zbl 0644.05036) Full Text: DOI
Knuth, Donald E. Dynamic Huffman coding. (English) Zbl 0606.94007 J. Algorithms 6, 163-180 (1985). MSC: 94A45 68P05 68R10 PDFBibTeX XMLCite \textit{D. E. Knuth}, J. Algorithms 6, 163--180 (1985; Zbl 0606.94007) Full Text: DOI
Noshita, Kohei A theorem on the expected complexity of Dijkstra’s shortest path algorithm. (English) Zbl 0576.68034 J. Algorithms 6, 400-408 (1985). MSC: 68Q25 68R10 05C38 05C35 PDFBibTeX XMLCite \textit{K. Noshita}, J. Algorithms 6, 400--408 (1985; Zbl 0576.68034) 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 PDFBibTeX XMLCite \textit{G. N. Frederickson} and \textit{D. B. Johnson}, J. Algorithms 4, 61--80 (1983; Zbl 0509.68057) Full Text: DOI