List of problems
Graphs
- Clique
- Maximum clique and clique number
- Clique cover
- Minimum clique cover and clique cover number
- k-coloring
- Minimum graph coloring and chromatic number
- Chromatic polyonomial
- Edge coloring problem and chromatic index
- Dominating set
- Minimum dominating set and domination number
- Independent dominating set
- Minimum independent dominating set and independent domination number
- Total dominating set
- Minimum total dominating set and total domination number
- Connected dominating
- Minimum connected dominating set and connected domination number
- Domatic partition search and decision problem
- Domatic partition problem and domatic number
- Directed and undirected Hamiltonian cycle
- Directed and undirected Hamiltonian path
- Directed and undirected
- Hamiltonian path with fixed start and end points
- Asymetric and symetric integer traveling salesperson decision problem
- Independent set
- Maximum independent set and independence number
- Independent dominating set
- Minimum independent dominating set and independent domination number
- Vertex cover
- Minimum vertex cover and vertex cover number
Games
- N-queens completion
- Blocked n-queens
- Latin square completion
- Sudoku completion
Sets
- Partition
- k-partition
- Subset sum
- k-way number partitioning
- Bin packing
- Minimum Bin Packing
- Set cover
- Minimum set cover
- Set packing
- Maximum set packing
- Exact cover
- Hitting set
- Minimum hitting set
- Exact hitting set
- Set splitting
- Knapsack
- Bounded knapsack
- Unbounded knapsack
Language (Strings)
Back to top