A group testing problem for graphs with several defective edges

DOI10.1016/S0166-218X(01)00181-0zbMath0994.68094MaRDI QIDQ1348382

Petra Johann

Publication date: 15 May 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial search problemgrouptesting

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing ⋮ A competitive algorithm in searching for many edges in a hypergraph ⋮ Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing ⋮ A competitive algorithm to find all defective edges in a graph ⋮ Unnamed Item ⋮ A revised algorithm for searching for all defective edges in a graph

Cites Work

• Competitive group testing
• A tight upper bound for group testing in graphs
• A group testing problem for hypergraphs of bounded rank
• A Group Testing Problem on Two Disjoint Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A group testing problem for graphs with several defective edges