Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
From MaRDI portal
Publication:6167664
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A faster algorithm for betweenness centrality*
- An integer programming approach for finding the most and the least central cliques
- Clique-detection models in computational biochemistry and genomics
- Collective dynamics of `small-world' networks
- Community structure in social and biological networks
- Degree sum and vertex dominating paths
- Detecting a most closeness-central clique in complex networks
- Finding clique clusters with the highest betweenness centrality
- Finding cores of limited length
- Finding critical links for closeness centrality
- Finding groups with maximum betweenness centrality
- Identifying sets of key players in a social network
- Minimum degree and dominating paths
- Network Analysis
- Network flows. Theory, algorithms, and applications.
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Networks
- On clique relaxation models in network analysis
- On exact solution approaches for the longest induced path problem
- On locating path- or tree-shaped facilities on networks
- Optimal location of a path or tree on a network with cycles
- Social and economic networks.
- Statistical mechanics of complex networks
- The University of Florida sparse matrix collection
- The centrality of groups and classes
This page was built for publication: Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167664)
