| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421441 | Discrete Applied Mathematics | 2007 | 6 Pages |
Abstract
We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. Damaschke did the d=1d=1 case for 2-graphs, Triesch extended the d=1d=1 case to r-graphs, and Johann did the general d case for 2-graphs. So ours is the first attempt to solve the searching for defective edges problem in its full generality. Further, all the above three papers assumed d known. We give a competitive algorithm where d is unknown.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ting Chen, Frank K. Hwang,