Optimization Algorithms for Clique Problems
Cette thèse présente des algorithmes de résolution de quatre problèmes de clique : clique de poids maximum (MVWCP), s-plex maximum (MsPlex), clique maximum équilibrée dans un graphe biparti (MBBP) et clique partition (CPP). Les trois premiers problèmes sont des généralisations ou relaxations du prob...
Main Author: | Zhou, Yi |
---|---|
Other Authors: | Angers |
Language: | en fr |
Published: |
2017
|
Subjects: | |
Online Access: | http://www.theses.fr/2017ANGE0013/document |
Similar Items
-
Exact Algorithms for Maximum Clique: A Computational Study
by: Patrick Prosser
Published: (2012-11-01) -
Circuit design for clique problem and its implementation on quantum computer
by: Chakrabarti, A., et al.
Published: (2022) -
Maximal Clique Scheduling: A Simple Algorithm to Bound Maximal Independent Graph Scheduling
by: Sutuntivorakoon, Kanes
Published: (2012) -
An Efficient Local Search for the Maximum Edge Weighted Clique Problem
by: Ruizhi Li, et al.
Published: (2018-01-01) -
Discovering the maximum k-clique on social networks using bat optimization algorithm
by: Akram Khodadadi, et al.
Published: (2021-02-01)