A revised algorithm for searching for all defective edges in a graph

DOI10.1016/J.DAM.2011.08.004MaRDI QIDQ765324zbMATH OpenOpenAlexFDO

Authors Ting Chen

Publication date 19 March 2012

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

Full work available at URL https://doi.org/10.1016/j.dam.2011.08.004

zbMATH Keywords

group testingcompetitive algorithmgraph testingdefective edges

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A group testing problem for graphs with several defective edges
• Non-adaptive group testing on graphs
• A competitive algorithm to find all defective edges in a graph
• A competitive algorithm in searching for many edges in a hypergraph
• Edge search in graphs with restricted test sets

Cites work

• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• A Group Testing Problem on Two Disjoint Sets
• A competitive algorithm to find all defective edges in a graph
• A group testing problem for graphs with several defective edges
• A group testing problem for hypergraphs of bounded rank
• A tight upper bound for group testing in graphs
• Competitive group testing

Cited in

(5)

• A competitive algorithm to find all defective edges in a graph
• Identifying defective network components through restricted group testing
• A competitive algorithm in searching for many edges in a hypergraph
• A group testing problem for graphs with several defective edges
• More efficient algorithms for searching for several edges in a hypergraph

This page was built for publication: A revised algorithm for searching for all defective edges in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765324)