✦ LIBER ✦

Series - parallel graphs and depth-first search trees

✍ Scribed by Syslo, M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for finding depth-f

✍ C. Rhee; Y.Daniel Liang; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 512 KB

The Depth-First Search Tree Structure of

✍ R. Diestel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Edge-disjoint spanning trees and depth-f

✍ Robert Endre Tarjan 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 707 KB

Parallel local search for Steiner trees

✍ M.G.A. Verhoeven; M.E.M. Severens 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 242 KB

A note on parallel depth first search

✍ Y. Zhang 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 122 KB

Parallel depth first search. Part I. Imp

✍ V. Nageshwara Rao; Vipin Kumar 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 995 KB