✦ LIBER ✦

Connected graph searching

✍ Scribed by Lali Barrière; Paola Flocchini; Fedor V. Fomin; Pierre Fraigniaud; Nicolas Nisse; Nicola Santoro; Dimitrios M. Thilikos

Book ID: 118131285
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 315 KB
Volume: 219
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2012.08.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connected graph searching in chordal gra

Connected graph searching in chordal graphs

✍ Nicolas Nisse 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 826 KB

Monotony properties of connected visible

Monotony properties of connected visible graph searching

✍ Pierre Fraigniaud; Nicolas Nisse 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Time constrained graph searching

✍ Brian Alspach; Danny Dyer; Denis Hanson; Boting Yang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 335 KB

On fuzzy graph searching

✍ Adnan K. Shaout 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 61 KB

Monotonicity in graph searching

✍ D Bienstock; Paul Seymour 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 381 KB

Algorithms for path searching and for gr

Algorithms for path searching and for graph connectivity analysis

✍ A. Recuero 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 980 KB

Three algorithms for the search of oriented paths in digraphs are described, based in the generation of a tree, in which an BFS is done, in the first one, and a DFS is done, in the other two algorithms. The first one is aimed at finding all the optimum paths between two vertices. The second one is a