This project together with mrcp document explain process of develop and analitic of MRCP or Maximum Ratio Clique Problem. Wich starting from a graph with nodes and different weights of these, the algorithm will find an aproximate optimal solution, forming a clique or a complete sub-graph with maximum ratio.
-
Notifications
You must be signed in to change notification settings - Fork 0
This project together with mrcp document explain process of develop and analitic of MRCP or Maximum Ratio Clique Problem. Wich starting from a graph with nodes and different weights of these, the algorithm will find an aproximate optimal solution, forming a clique or a complete sub-graph with maximum ratio.
License
JoseMiguel92/mrcp-project
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project together with mrcp document explain process of develop and analitic of MRCP or Maximum Ratio Clique Problem. Wich starting from a graph with nodes and different weights of these, the algorithm will find an aproximate optimal solution, forming a clique or a complete sub-graph with maximum ratio.
Topics
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published