Pages that link to "Item:Q1805463"

The following pages link to Generating hard and diverse test sets for NP-hard graph problems (Q1805463):

Displayed 2 items.

• Better approximations of non-Hamiltonian graphs (Q1382268) ‎ (← links)
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) ‎ (← links)