Pages that link to "Item:Q2014718"
From MaRDI portal
The following pages link to An NP-completeness result of edge search in graphs (Q2014718):
Displaying 5 items.
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- Edge search number of cographs (Q415273) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185) (← links)