Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding the most degree-central walks and paths in a graph: exact and heuristic approaches |
scientific article; zbMATH DE number 7709264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the most degree-central walks and paths in a graph: exact and heuristic approaches |
scientific article; zbMATH DE number 7709264 |
Statements
Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (English)
0 references
10 July 2023
0 references
networks
0 references
degree centrality
0 references
group centrality
0 references
network analysis
0 references
mixed-integer programming
0 references
0 references
