solveNP

Travelling Salesman

Overall ranking
Rank User Solution Description

Graph Coloring

Overall ranking
Rank User Solution Description
1 Vanand Gasparyan RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
3 Vanand Gasparyan Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
Rankings per input
small_ultra_sparse.txt
Rank User Score Solution Description
1 Vanand Gasparyan 6 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
1 Vanand Gasparyan 6 RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan 8 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
small_sparse.txt
Rank User Score Solution Description
1 Vanand Gasparyan 12 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
1 Vanand Gasparyan 12 RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan 15 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
small_dense.txt
Rank User Score Solution Description
1 Vanand Gasparyan 21 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
2 Vanand Gasparyan 22 RLF heuristic Slower than DSatur but better for large sparse graphs.
3 Vanand Gasparyan 26 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
medium_ultra_sparse.txt
Rank User Score Solution Description
1 Vanand Gasparyan 25 RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan 27 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
3 Vanand Gasparyan 32 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
medium_sparse.txt
Rank User Score Solution Description
1 Vanand Gasparyan 64 RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan 68 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
3 Vanand Gasparyan 77 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
medium_dense.txt
Rank User Score Solution Description
1 Vanand Gasparyan 135 RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan 145 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
3 Vanand Gasparyan 157 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
large_ultra_sparse.txt
Rank User Score Solution Description
1 Vanand Gasparyan 160 RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan 170 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
3 Vanand Gasparyan 184 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
large_sparse.txt
Rank User Score Solution Description
1 Vanand Gasparyan 457 RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan 478 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
3 Vanand Gasparyan 503 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.
large_dense.txt
Rank User Score Solution Description
1 Vanand Gasparyan 1035 RLF heuristic Slower than DSatur but better for large sparse graphs.
2 Vanand Gasparyan 1064 DSatur heuristic algorithm Similar to Greedy, but colors the high degree nodes first. https://en.wikipedia.org/wiki/DSatur
3 Vanand Gasparyan 1117 Greedy coloring Try to color each node with already used colors, checking for conflicts with neighbors.