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

DOI10.1016/J.EJOR.2022.12.014MaRDI QIDQ6167664FDOQ6167664

Authors: Dmytro Matsypura, Alexander Veremyev, Eduardo L. Pasiliao, Oleg A. Prokopyev 

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

network analysisnetworksmixed-integer programmingdegree centralitygroup centrality

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• The University of Florida sparse matrix collection
• Network flows. Theory, algorithms, and applications.
• Statistical mechanics of complex networks
• Community structure in social and biological networks
• Title not available (Why is that?)
• Collective dynamics of `small-world' networks
• Identifying sets of key players in a social network
• The centrality of groups and classes
• A faster algorithm for betweenness centrality*
• Network Analysis
• On clique relaxation models in network analysis
• An integer programming approach for finding the most and the least central cliques
• Clique-detection models in computational biochemistry and genomics
• Social and economic networks.
• Network interdiction through length-bounded critical disruption paths: a bi-objective approach
• Network interdiction via a critical disruption path: branch-and-price algorithms
• On locating path- or tree-shaped facilities on networks
• Optimal location of a path or tree on a network with cycles
• Detecting a most closeness-central clique in complex networks
• Finding critical links for closeness centrality
• Finding groups with maximum betweenness centrality
• Finding clique clusters with the highest betweenness centrality
• Networks
• Finding cores of limited length
• On exact solution approaches for the longest induced path problem
• Degree sum and vertex dominating paths
• Minimum degree and dominating paths

Cited In (1)

• A survey on optimization studies of group centrality metrics

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)