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 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
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
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