ElGindy, Hossam; Nicolescu, Radu; Wu, Huiling Fast distributed DFS solutions for edge-disjoint paths in digraphs. (English) Zbl 1388.68226 Csuhaj-Varjú, Erzsébet (ed.) et al., Membrane computing. 13th international conference, CMC 2012, Budapest, Hungary, August 28–31, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36750-2/pbk). Lecture Notes in Computer Science 7762, 173-194 (2013). MSC: 68R10 05C20 05C38 68W15 PDF BibTeX XML Cite \textit{H. ElGindy} et al., Lect. Notes Comput. Sci. 7762, 173--194 (2013; Zbl 1388.68226) Full Text: DOI
Nicolescu, Radu; Wu, Huiling New solutions for disjoint paths in P systems. (English) Zbl 1331.68287 Nat. Comput. 11, No. 4, 637-651 (2012). MSC: 68W15 05C21 05C38 68R10 68T20 PDF BibTeX XML Cite \textit{R. Nicolescu} and \textit{H. Wu}, Nat. Comput. 11, No. 4, 637--651 (2012; Zbl 1331.68287) Full Text: DOI
Saifullah, Abusayeed; Tsin, Yung H. Self-stabilizing computation of 3-edge-connected components. (English) Zbl 1311.68032 Int. J. Found. Comput. Sci. 22, No. 5, 1161-1185 (2011). MSC: 68M14 68M15 68W15 PDF BibTeX XML Cite \textit{A. Saifullah} and \textit{Y. H. Tsin}, Int. J. Found. Comput. Sci. 22, No. 5, 1161--1185 (2011; Zbl 1311.68032) Full Text: DOI
Nicolescu, Radu; Wu, Huiling BFS solution for disjoint paths in P systems. (English) Zbl 1330.68342 Calude, Cristian S. (ed.) et al., Unconventional computation. 10th international conference, UC 2011, Turku, Finland, June 6–10, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21340-3/pbk). Lecture Notes in Computer Science 6714, 164-176 (2011). MSC: 68W15 05C21 05C38 68R10 68T20 PDF BibTeX XML Cite \textit{R. Nicolescu} and \textit{H. Wu}, Lect. Notes Comput. Sci. 6714, 164--176 (2011; Zbl 1330.68342) Full Text: DOI
Cournier, Alain; Devismes, Stéphane; Petit, Franck; Villain, Vincent Snap-stabilizing depth-first search on arbitrary networks. (English) Zbl 1129.68375 Higashino, Teruo (ed.), Principles of distributed systems. 8th international conference, OPODIS 2004, Grenoble, France, December 15–17, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-27324-7/pbk). Lecture Notes in Computer Science 3544, 267-282 (2005). MSC: 68M14 68M12 68M15 68M20 PDF BibTeX XML Cite \textit{A. Cournier} et al., Lect. Notes Comput. Sci. 3544, 267--282 (2005; Zbl 1129.68375) Full Text: DOI
Bošnački, Dragan A nested depth first search algorithm for model checking with symmetry reduction. (English) Zbl 1037.68550 Peled, Doron A. (ed.) et al., Formal techniques for networked and distributed systems – FORTE 2002. 22nd IFIP WG 6.1 international conference, Houston, Texas, USA, November 11–14, 2002. Proceedings. Berlin: Springer (ISBN 3-540-00141-7/pbk). Lect. Notes Comput. Sci. 2529, 65-80 (2002). MSC: 68Q60 68M14 68Q45 68Q85 PDF BibTeX XML Cite \textit{D. Bošnački}, Lect. Notes Comput. Sci. 2529, 65--80 (2002; Zbl 1037.68550) Full Text: Link
Tsin, Y. H. Some remarks on distributed depth-first search. (English) Zbl 1044.68633 Inf. Process. Lett. 82, No. 4, 173-178 (2002). MSC: 68Q25 68W10 PDF BibTeX XML Cite \textit{Y. H. Tsin}, Inf. Process. Lett. 82, No. 4, 173--178 (2002; Zbl 1044.68633) Full Text: DOI
Makki, S. A. M.; Havas, George Distributed algorithms for depth-first search. (English) Zbl 0875.68474 Inf. Process. Lett. 60, No. 1, 7-12 (1996). MSC: 68W10 PDF BibTeX XML Cite \textit{S. A. M. Makki} and \textit{G. Havas}, Inf. Process. Lett. 60, No. 1, 7--12 (1996; Zbl 0875.68474) Full Text: DOI
de la Torre, Pilar; Kruskal, Clyde P. Fast parallel algorithms for all-sources lexicographic search and path-algebra problems. (English) Zbl 0849.68050 J. Algorithms 19, No. 1, 1-24 (1995). MSC: 68W15 68P10 PDF BibTeX XML Cite \textit{P. de la Torre} and \textit{C. P. Kruskal}, J. Algorithms 19, No. 1, 1--24 (1995; Zbl 0849.68050) Full Text: DOI
Ye, Xinming A distributed algorithm for determining minimal covers of acyclic database schemes. (English) Zbl 0808.68058 J. Comput. Sci. Technol. 9, No. 3, 204-214 (1994). MSC: 68P15 68W15 68P10 PDF BibTeX XML Cite \textit{X. Ye}, J. Comput. Sci. Technol. 9, No. 3, 204--214 (1994; Zbl 0808.68058) Full Text: DOI
Collin, Zeev; Dolev, Shlomi Self-stabilizing depth-first search. (English) Zbl 0803.68041 Inf. Process. Lett. 49, No. 6, 297-301 (1994). MSC: 68W15 68P10 PDF BibTeX XML Cite \textit{Z. Collin} and \textit{S. Dolev}, Inf. Process. Lett. 49, No. 6, 297--301 (1994; Zbl 0803.68041) Full Text: DOI
Korach, Ephraim; Ostfeld, Zvi Recognition of DFS trees: Sequential and parallel algorithms with refined verifications. (English) Zbl 0787.68081 Discrete Math. 114, No. 1-3, 305-327 (1993). Reviewer: E.Korach MSC: 68R10 05C85 68W15 05C05 68Q25 05C20 05C38 PDF BibTeX XML Cite \textit{E. Korach} and \textit{Z. Ostfeld}, Discrete Math. 114, No. 1--3, 305--327 (1993; Zbl 0787.68081) Full Text: DOI
Goldberg, Andrew V.; Plotkin, Serge A.; Vaidya, Pravin M. Sublinear-time parallel algorithms for matching and related problems. (English) Zbl 0769.68034 J. Algorithms 14, No. 2, 180-213 (1993). MSC: 68W15 90B10 PDF BibTeX XML Cite \textit{A. V. Goldberg} et al., J. Algorithms 14, No. 2, 180--213 (1993; Zbl 0769.68034) Full Text: DOI
Ghosh, R. K. Parallel search algorithms for graphs and trees. (English) Zbl 0764.68050 Inf. Sci. 67, No. 1-2, 137-165 (1993). MSC: 68W15 68R10 05C05 05C85 05C70 PDF BibTeX XML Cite \textit{R. K. Ghosh}, Inf. Sci. 67, No. 1--2, 137--165 (1993; Zbl 0764.68050) Full Text: DOI
Suraweera, Francis; Bhattacharya, Prabir A parallel cost-optimal algorithm to compute the supremum of max-min powers. (English) Zbl 0754.68059 Parallel Comput. 18, No. 5, 551-556 (1992). MSC: 68W15 68R10 PDF BibTeX XML Cite \textit{F. Suraweera} and \textit{P. Bhattacharya}, Parallel Comput. 18, No. 5, 551--556 (1992; Zbl 0754.68059) Full Text: DOI
Kalé, L. V.; Saletore, Vikram A. Parallel state-space search for a first solution with consistent linear speedups. (English) Zbl 0723.68043 Int. J. Parallel Program. 19, No. 4, 251-293 (1990). MSC: 68W15 68P05 PDF BibTeX XML Cite \textit{L. V. Kalé} and \textit{V. A. Saletore}, Int. J. Parallel Program. 19, No. 4, 251--293 (1990; Zbl 0723.68043) Full Text: DOI
Ahuja, Mohan; Zhu, Yahui An efficient distributed algorithm for finding articulation points, bridges, and biconnected components in asynchronous networks. (English) Zbl 0734.68013 Foundations of software technology and theoretical computer science, Proc. 9th Conf., Bangalore/India 1989, Lect. Notes Comput. Sci. 405, 99-108 (1989). MSC: 68M10 68W15 68Q25 PDF BibTeX XML