The following pages link to (Q4778579):
Displayed 5 items.
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← 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)