MinLCA algorithms
|
▼ lemon | |
grb.cc | A skeleton file to implement LP solver interfaces |
grb.h | Header of the LEMON-Gurobi solver interface |
▼ minlca | |
base.hh | Defines the base class for MinLCA algorithms |
greedy-lp.hh | Definitions for the greedy algorithms using linear programming |
greedy-random.hh | Definitions of randomised greedy algorithms |
greedy.hh | |
lp-model.hh | Defines the relaxed linear programming model for MinLCA |
mip-model.hh | Defines the integer linear programming model for MinLCA |
optimisation-profiler.hh | Contains the definitions for timing MinLCA optimisation algorithms |
optimisation-sa-colours.hh | Definitions for a simulated annealing approach changing the colours |
optimisation-sa-greedy.hh | Definitions for simulated annealing using greedy recolourings |
optimisation.hh | Defines the base class for MinLCA optimisation algorithms |
profiler.hh | Contains the definitions for timing MinLCA algorithms |
▼ utils | |
▼ generators | |
binomial.hh | Contains definition for BinomialRandom graphs |
cliques.hh | Contains definition for graphs with cliques |
geometric.hh | Contains definition for RandomGeometric graphs |
outerplanar.hh | Contains definition for RandomOuterplanar graphs |
random-graph.hh | Contains base definitions for defining particular random graphs |
graph_utils.hh | Functions for reading graphs and getting graph properties |
simulated-annealing.hh | Description of generic simulated annealing algorithm |
timer.cc | Implementation of Timer |
timer.hh | Description of Timer |
utils.hh | Utils not related to graphs |
greedy_binomial_random.cc | Program to test the greedy algorithms on BinomialRandom graphs |
greedy_clique_cycle.cc | Program to test the greedy algorithms on cycles of cliques |
greedy_clique_graph.cc | Program to test the greedy algorithms on graphs with cliques |
greedy_lp_read_graph.cc | Program to test the greedy algorithms with linear programming on graphs from files |
greedy_random_geometric.cc | Program to test the greedy algorithms on random geometric graphs |
greedy_random_outerplanar.cc | Program to test the greedy algorithms on random outerplanar graphs |
greedy_read_graph.cc | Program to test the greedy algorithms on graphs from files |
greedy_rnd_read_graph.cc | Program to test the randomised greedy algorithms on graphs from files |
mip_read_graph.cc | Program to test the greedy algorithms with integer linear programming on graphs from files |
sa_colours_read_graph.cc | Program to test simulated annealing changing the colours on graphs from files |
sa_greedy_random_geometric.cc | Program to test the greedy algorithms with simulated annealing on random geometric graphs |
sa_greedy_random_outerplanar.cc | Program to test the greedy algorithms with simulated annealing on random outerplanar graphs |
sa_greedy_read_graph.cc | Program to test the greedy algorithms with simulated annealing on graphs from files |