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)
-
Criticality index analysis based optimal RFID reader placement models for asset tracking
Oztekin, Asil, (2010)
-
An RFID network design methodology for asset tracking in healthcare
Oztekin, Asil, (2010)
- More ...