Detecting a most closeness-central clique in complex networks
Year of publication: |
2020
|
---|---|
Authors: | Nasirian, Farzaneh ; Mahdavi Pajouh, Foad ; Balasundaram, Balabhaskar |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 283.2020, 2 (1.6.), p. 461-475
|
Subject: | Clique | Closeness centrality | Exact algorithms | Networks | NP-completeness | Algorithmus | Algorithm | Netzwerk | Network | Soziales Netzwerk | Social network | Unternehmensnetzwerk | Business network | Graphentheorie | Graph theory |
-
Chen, Fengzhang, (2020)
-
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag, (2015)
-
The vertex attack tolerance of complex networks
Matta, John, (2017)
- More ...
-
Exact algorithms for the minimum cost vertex blocker clique problem
Nasirian, Farzaneh, (2019)
-
On characterization of maximal independent sets via quadratic optimization
Mahdavi Pajouh, Foad, (2013)
-
A specialty steel bar company uses analytics to determine available-to-promise dates
Mahdavi Pajouh, Foad, (2013)
- More ...