GitHub - lielgut/OptimalGraphCol: Testing different exact and approximate algorithms for minimal vertex coloring in undirected graphs. · GitHub

Repository navigation

OptimalGraphCol

Public

About

Testing different exact and approximate algorithms for minimal vertex coloring in undirected graphs.

1 star

1 watching

Report repository

Name		Name	Last commit message	Last commit date
ml_data		ml_data
.gitignore		.gitignore
dsatur_graph_col.py		dsatur_graph_col.py
graph_col_ml_predict.py		graph_col_ml_predict.py
graph_col_ml_train.py		graph_col_ml_train.py
graph_col_opt.py		graph_col_opt.py
greedy_graph_col.py		greedy_graph_col.py
linear_prog_graph_col.py		linear_prog_graph_col.py
naive_graph_col.py		naive_graph_col.py

About

Testing different exact and approximate algorithms for minimal vertex coloring in undirected graphs.

1 star

1 watching

Report repository

Releases

Packages

Contributors

Languages