Kumar, Vipin A general heuristic bottom-up procedure for searching AND/OR graphs. (English) Zbl 0718.68059 Inf. Sci. 56, No. 1-3, 39-57 (1991). MSC: 68R10 68T20 90C39 90C35 PDFBibTeX XMLCite \textit{V. Kumar}, Inf. Sci. 56, No. 1--3, 39--57 (1991; Zbl 0718.68059) Full Text: DOI
Kumar, Vipin; Rao, V. Nageshwara Parallel depth first search. II: Analysis. (English) Zbl 0665.68049 Int. J. Parallel Program. 16, No. 6, 501-519 (1987). Reviewer: D.Grigoraş MSC: 68P10 68N99 68Q25 68N25 PDFBibTeX XMLCite \textit{V. Kumar} and \textit{V. N. Rao}, Int. J. Parallel Program. 16, No. 6, 501--519 (1987; Zbl 0665.68049) Full Text: DOI
Rao, V. Nageshwara; Kumar, Vipin Parallel depth first search. I: Implementation. (English) Zbl 0665.68048 Int. J. Parallel Program. 16, No. 6, 479-499 (1987). Reviewer: D.Grigoraş MSC: 68P10 68N99 68Q25 68N25 PDFBibTeX XMLCite \textit{V. N. Rao} and \textit{V. Kumar}, Int. J. Parallel Program. 16, No. 6, 479--499 (1987; Zbl 0665.68048) Full Text: DOI
Nau, Dana S.; Kumar, Vipin; Kanal, Laveen General branch and bound, and its relation to \(A^*\) and \(AO^*\). (English) Zbl 0537.68064 Artif. Intell. 23, 29-58 (1984). MSC: 68P10 68T20 90B40 PDFBibTeX XMLCite \textit{D. S. Nau} et al., Artif. Intell. 23, 29--58 (1984; Zbl 0537.68064) Full Text: DOI
Kumar, Vipin; Kanal, Laveen N. A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures. (English) Zbl 0507.68062 Artif. Intell. 21, 179-198 (1983). MSC: 68T99 68P10 90B40 PDFBibTeX XMLCite \textit{V. Kumar} and \textit{L. N. Kanal}, Artif. Intell. 21, 179--198 (1983; Zbl 0507.68062) Full Text: DOI