Finding influential groups in networked systems : the most degree-central clique problem
| Year of publication: |
2021
|
|---|---|
| Authors: | Zhong, Haonan ; Mahdavi Pajouh, Foad ; Prokopyev, Oleg |
| Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 101.2021, p. 1-13
|
| Subject: | Clique | Combinatorial branch-and-bound | Degree centrality | Integer programming | Network analysis | Ganzzahlige Optimierung | Soziales Netzwerk | Social network | Unternehmensnetzwerk | Business network | Netzwerk | Network | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Ricca, Federica, (2024)
-
Finding the most degree-central walks and paths in a graph : exact and heuristic approaches
Matsypura, Dmytro, (2023)
-
P-hub median problem for non-complete networks
Akgün, İbrahim, (2018)
- More ...
-
On designing networks resilient to clique blockers
Zhong, Haonan, (2023)
-
On interdicting dense clusters in a network
Zhong, Haonan, (2025)
-
Integer programming formulations for minimum spanning tree interdiction
Wei, Ningji, (2021)
- More ...