✦ LIBER ✦

On the existence of special depth first search trees

✍ Scribed by Ephraim Korach; Zvi Ostfeld

Book ID: 118284388
Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 641 KB
Volume: 19
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190190408

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Depth-First Search Tree Structure of

The Depth-First Search Tree Structure of TKℵ0-Free Graphs

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

Lower Bound on Expected Complexity of De

Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii

✍ Ahn, J.; Kiseon Kim 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 180 KB

On the recursion depth of special tree t

On the recursion depth of special tree traversal algorithms

✍ Peter Kirschenhofer; Helmut Prodinger 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 646 KB

The incremental maintenance of a Depth-F

The incremental maintenance of a Depth-First-Search tree in directed acyclic graphs

✍ Paolo G. Franciosa; Giorgio Gambosi; Umberto Nanni 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 748 KB

We propose an incremental algorithm to maintain a DFS-forest in a directed acyclic graph under a sequence of arc insertions in 0( nm) worst case total time, where n is the number of nodes and m is the number of arcs after the insertions. This compares favorably with the time required to recompute DF

On the best search strategy in parallel

On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search

✍ J. Clausen; M. Perregaard 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 111 KB

On the existence of indiscernible trees

✍ Kota Takeuchi; Akito Tsuboi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 253 KB