๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Depth-first search as a combinatorial correspondence

โœ Scribed by Ira Gessel; Da-Lun Wang

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
253 KB
Volume
26
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Refinements to depth-first iterative-dee
Refinements to depth-first iterative-deepening search in automatic theorem proving
โœ Xumin Nie; David A. Plaisted ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 639 KB

This paper will dzscuss two refinements to the depth-first tteratlve-deepemng search strategy The first refinement, the priority system, ts an attempt to simulate best-first search usmg depth-first tterattvedeepenmg search A new data structure, the priority hst, ts introduced mto depth-first tteratt

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