论文信息 - A Parallel Algorithm for Nearly Optimal Edge Search

A Parallel Algorithm for Nearly Optimal Edge Search

We provide a parallel algorithm that finds an induced subgraph of a given graph G that contains approximately half the edges of G. This is used for the parallel construction of a nearly optimal group testing strategy in the case of two defective elements.

Peter Damaschke

[1] Eberhard Triesch,et al. Realizability and uniqueness in graphs , 1994, Discret. Math..

[2] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .

[3] Eberhard Triesch,et al. Edge search in graphs and hypergraphs of bounded rank , 1993, Discret. Math..

[4] Peter Damaschke. A Tight Upper Bound for Group Testing in Graphs , 1994, Discret. Appl. Math..