alanerse / Maximum-Independent-Set Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

Algorithm for solving the problems of maximum independent set, maximum clique and satisfiability, using Branch and Bound

2 stars 0 forks Branches Tags Activity

Name		Name	Last commit message	Last commit date
Latest commit History 18 Commits
.idea		.idea
README.md		README.md
entradaSat.txt		entradaSat.txt
grafo.txt		grafo.txt
main.py		main.py

Repository files navigation

IndependentSet

Algoritmo de conjunto independente máximo(talvez kkkk), utilizando Branch and Bound