✦ LIBER ✦

On depth first search strees inm-out digraphs

✍ Scribed by W. C. Stephen Suen

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 801 KB
Volume: 13
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01303205

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some remarks on distributed depth-first

Some remarks on distributed depth-first search

✍ Y.H Tsin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 76 KB

A note on parallel depth first search

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

On Linear Time Minor Tests with Depth-Fi

On Linear Time Minor Tests with Depth-First Search

✍ H.L. Bodlaender 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 911 KB

Recent results on graph minors make it desirable to have efficient algorithms that, for a fixed set of graphs \(\left\{H_{1}, \ldots, H_{c}\right\}\), test whether a given graph \(G\) contains at least one graph \(H_{i}\) as a minor. In this paper we show the following result: if at least one graph