Pages that link to "Item:Q1322293"
From MaRDI portal
The following pages link to A probabilistic upper bound for the edge identification complexity of graphs (Q1322293):
Displaying 6 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- Edge search in graphs with restricted test sets (Q1045083) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)