✦ LIBER ✦

Search problems on graphs

✍ Scribed by M. Aigner

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 609 KB
Volume: 14
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90026-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A ternary search problem on graphs

✍ Thomas Andreae 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 674 KB

A binary search problem on graphs

✍ Reinhard Franzkeit 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Special Issue on “Theory and Application

Special Issue on “Theory and Applications of Graph Searching Problems”

✍ Fedor V. Fomin; Pierre Fraigniaud; Stephan Kreutzer; Dimitrios M. Thilikos 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Call for Papers Special Issue on ''Theory and Applications of Graph Searching Problems'' Manuscripts are solicited for a special issue in the journal ''Theoretical Computer Science'' (TCS) on ''Theory and Applications of Graph Searching Problems''. This special issue will be dedicated to the 60th bi

On fuzzy graph searching

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

Tabu search for the Steiner problem in g

Tabu search for the Steiner problem in graphs

✍ Celso C. Ribeiro; Maurício C. De Souza 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o

On polychotomous search problems

✍ Karl Hinderer; Michael Stieglitz 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 917 KB