A PARALLEL ALGORITHM FOR NEARLY OPTIMAL EDGE SEARCH

Authors
DAMASCHKE P
Citation
P. Damaschke, A PARALLEL ALGORITHM FOR NEARLY OPTIMAL EDGE SEARCH, Information processing letters, 56(4), 1995, pp. 233-236
Citations number
6
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
56
Issue
4
Year of publication
1995
Pages
233 - 236
Database
ISI
SICI code
0020-0190(1995)56:4<233:APAFNO>2.0.ZU;2-5
Abstract
We provide a parallel algorithm that finds an induced subgraph of a gi ven graph G that contains approximately half the edges of G. This is u sed for the parallel construction of a nearly optimal group testing st rategy in the case of two defective elements.