graph-coloring-max-gain

Maximizing the number of discovered nonzero entries via a combinatorial model

Name		Name	Last commit message	Last commit date
Latest commit History 30 Commits
CMakeLists.txt		CMakeLists.txt
Mtx2Graph.cpp		Mtx2Graph.cpp
Mtx2Graph.hpp		Mtx2Graph.hpp
README.md		README.md
TestMaxGain.py		TestMaxGain.py
datatypes.hpp		datatypes.hpp
experiments.py		experiments.py
experiments2.py		experiments2.py
experiments3.py		experiments3.py
experiments_with_matrices.py		experiments_with_matrices.py
graph.h		graph.h
main.cpp		main.cpp
main2.cpp		main2.cpp
main_bipartite.cpp		main_bipartite.cpp
main_simple_graph.cpp		main_simple_graph.cpp
mmio.cpp		mmio.cpp
mmio.h		mmio.h
prettyprint.hpp		prettyprint.hpp
stats.py		stats.py
vis3d.py		vis3d.py
vis3d_bck.py		vis3d_bck.py

Provide feedback