Pages that link to "Item:Q1805463"
From MaRDI portal
The following pages link to Generating hard and diverse test sets for NP-hard graph problems (Q1805463):
Displaying 5 items.
- On the complexity of test case generation for NP-hard problems (Q917311) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
- Approximation of coNP sets by NP-complete sets (Q6064009) (← links)