Pages that link to "Item:Q5905225"

The following pages link to The NP-completeness column: An ongoing guide (Q5905225):

Displaying 10 items.

• Quadratic forms and the graph isomorphism problem (Q810529) (← links)
• A useful transform of standard input data for a classical NP-complete problem (Q1058470) (← links)
• Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
• A catalog of minimally nonideal matrices (Q1298742) (← links)
• An approximation scheme for strip packing of rectangles with bounded dimensions (Q1383370) (← links)
• A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
• Formally proving size optimality of sorting networks (Q1694569) (← links)
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
• HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
• Incremental bipartite drawing problem (Q5955967) (← links)