Similar Search Results

Finding influential groups in networked systems : the most degree-central clique problem

Zhong, Haonan; Mahdavi Pajouh, Foad; Prokopyev, Oleg - In: Omega : the international journal of management science 101 (2021), pp. 1-13

Persistent link: https://www.econbiz.de/10012494674

Detecting a most closeness-central clique in complex networks

Nasirian, Farzaneh; Mahdavi Pajouh, Foad; Balasundaram, … - In: European journal of operational research : EJOR 283 (2020) 2, pp. 461-475

Persistent link: https://www.econbiz.de/10012294843

On the maximum small-world subgraph problem

Kim, Jongeun; Veremyev, Alexander; Boginski, Vladimir; … - In: European journal of operational research : EJOR 280 (2020) 3, pp. 818-831

Persistent link: https://www.econbiz.de/10012132483

Finding the most degree-central walks and paths in a graph : exact and heuristic approaches

Matsypura, Dmytro; Veremyev, Alexander; Pasiliao, Eduardo L. - In: European journal of operational research : EJOR 308 (2023) 3, pp. 1021-1036

Persistent link: https://www.econbiz.de/10014311874

Cooperative networks : control and optimization

Grundel, Don (ed.); Murphey, Robert (ed.); … - 2008

Cooperative networks have gained a tremendous amount of attention over the last several years because of their existence not only in biological, social and economic arenas, but because of direct applications in many more areas such as communications, robotics and military sciences. This volume...

Persistent link: https://www.econbiz.de/10014474048