Pages that link to "Item:Q1045083"
From MaRDI portal
The following pages link to Edge search in graphs with restricted test sets (Q1045083):
Displaying 14 items.
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- A revised algorithm for searching for all defective edges in a graph (Q765324) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- Search problems on graphs (Q1082080) (← links)
- A ternary search problem on graphs (Q1118418) (← links)
- A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
- A tight upper bound for group testing in graphs (Q1315459) (← links)
- A group testing problem for graphs with several defective edges (Q1348382) (← links)
- Edge search in graphs and hypergraphs of bounded rank (Q1801680) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- Testing for edge terms is decidable (Q2351513) (← links)
- Group testing in graphs (Q2471072) (← links)
- A competitive algorithm to find all defective edges in a graph (Q2486071) (← links)
- On a combinatorial search problem (Q4809584) (← links)