Finding clique clusters with the highest betweenness centrality
Year of publication: |
16 November 2018
|
---|---|
Authors: | Rysz, Maciej ; Mahdavi Pajouh, Foad ; Pasiliao, Eduardo L. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 271.2018, 1 (16.11.), p. 155-164
|
Subject: | Networks | Betweenness centrality | Clique | NP-completeness | Combinatorial branch-and-bound | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory | Unternehmensnetzwerk | Business network |
-
Finding influential groups in networked systems : the most degree-central clique problem
Zhong, Haonan, (2021)
-
Detecting a most closeness-central clique in complex networks
Nasirian, Farzaneh, (2020)
-
Global distribution center number of some graphs and an algorithm
Durgut, Rafet, (2019)
- More ...
-
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
Rysz, Maciej, (2018)
-
Rysz, Maciej, (2015)
-
Minimum edge blocker dominating set problem
Mahdavi Pajouh, Foad, (2015)
- More ...