Pages that link to "Item:Q5905223"
From MaRDI portal
The following pages link to The NP-completeness column: An ongoing guide (Q5905223):
Displaying 11 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Minimum dimension embedding of finite metric spaces (Q1076679) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- On the complexity of H-coloring (Q1100215) (← links)
- Polynomial graph-colorings (Q1183345) (← links)
- Drawing graphs with mathematical programming and variable neighborhood search (Q1687683) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs (Q1919842) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
