Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
@Ogochi
Ogochi authored Dec 12, 2018
1 parent 9e8763b commit 0cf2ed3
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@ Everything is the same despite the fact you can match vertice `v` in graph with
Project has focus on undirected wighted graphs.

Our aim was to find approximation(not less than half of the best solution)
of matching with the greatest sum of weights on edges. There was made such a decision, beacause precise algorithms are slow or really complex.
of matching with the greatest sum of weights on edges. There was made such a decision, because precise algorithms are slow or really complex.

## Algorithm
Algorithm we were supposed to use is described in detail [here](https://www.cs.purdue.edu/homes/apothen/Papers/bMatching-SISC-2016.pdf).
Expand Down

0 comments on commit 0cf2ed3

Please sign in to comment.