✦ LIBER ✦

A general best first search algorithm in AND/OR graphs

✍ Scribed by P.P Chakrabarti; S Ghose

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 558 KB
Volume: 13
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(92)90014-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Best First Search Algorithm in AND/OR Gr

Best First Search Algorithm in AND/OR Graphs with Cycles

✍ Dušan Hvalica 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Efficient algorithms for finding depth-f

Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs

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

A branch-and-cut algorithm for solving g

A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs

✍ Suhl, Uwe H.; Hilbert, Heinrich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB 👁 2 views

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p