A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm
The minimum vertex-cover problem (MVCP) is an NP-complete optimization problem widely
used in areas such as graph theory, social network, security and transportation, etc. Different …
used in areas such as graph theory, social network, security and transportation, etc. Different …
[PDF][PDF] Label Propagation Community Optimization Via Boundary Nodes Transfers
F ÖZTEMİZ - researchgate.net
Many methods have been developed for community detection. These methods show
performance differences according to the structure of the networks. These performance …
performance differences according to the structure of the networks. These performance …