Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
From MaRDI portal
Publication:6167664
DOI10.1016/j.ejor.2022.12.014MaRDI QIDQ6167664
Oleg A. Prokopyev, Alexander Veremyev, Dmytro Matsypura, Eduardo L. Pasiliao
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifying sets of key players in a social network
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Finding clique clusters with the highest betweenness centrality
- On exact solution approaches for the longest induced path problem
- On clique relaxation models in network analysis
- Detecting a most closeness-central clique in complex networks
- An integer programming approach for finding the most and the least central cliques
- Clique-detection models in computational biochemistry and genomics
- A faster algorithm for betweenness centrality*
- Minimum Degree and Dominating Paths
- The university of Florida sparse matrix collection
- Statistical mechanics of complex networks
- On locating path- or tree-shaped facilities on networks
- Optimal location of a path or tree on a network with cycles
- The centrality of groups and classes
- Community structure in social and biological networks
- Networks
- Degree sum and vertex dominating paths
- Finding cores of limited length
- Finding Critical Links for Closeness Centrality
- Finding groups with maximum betweenness centrality
- Collective dynamics of ‘small-world’ networks
- Network Analysis
This page was built for publication: Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
