On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges

DOI10.1016/j.dam.2011.06.026zbMath1239.05128OpenAlexW2087483024MaRDI QIDQ411849

Tatjana Gerzen

Publication date: 30 April 2012

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

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

zbMATH Keywords

group testing problemcombinatorial search

Mathematics Subject Classification ID

2-person games (91A05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

An NP-completeness result of edge search in graphs

Cites Work

• Searching for an edge in a graph with restricted test sets
• Edge search in graphs with restricted test sets
• Competitive group testing
• A probabilistic upper bound for the edge identification complexity of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges