The following pages link to (Q4778579):
Displaying 10 items.
- Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- An exact graph coloring algorithm using color exchange (Q1374088) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- An exact algorithm for the channel assignment problem (Q1764816) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Path Problems in Complex Networks (Q2913787) (← links)
- Small Maximal Independent Sets and Faster Exact Graph Coloring (Q4435347) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)