𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A ternary search problem on graphs

✍ Scribed by Thomas Andreae


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
674 KB
Volume
23
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A binary search problem on graphs
✍ Reinhard Franzkeit πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 315 KB
Search problems on graphs
✍ M. Aigner πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 609 KB
A search problem on graphs which general
✍ Thomas Andreae πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 499 KB

A search problem on graphs which generalizes some group testing problems with two defectives, Discrete Mathematics 88 (1991) 121-127. We consider a search problem which generalizes the group testing problems previously studied in papers of Chang/Hwang and Chang/Hwang/Lin. In its general form for a

Tabu search for the Steiner problem in g
✍ 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

Special Issue on β€œTheory and Application
✍ 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