arXiv (All)
open access
Centrality of shortest paths: Algorithms and complexity results
The degree centrality of a node, defined as the number of nodes adjacent to it, is often used as a measure of importance of a node to the structure of a network. This metric can be extended to paths in a network, where the degree centrality of a path is defined as the number of nodes adjacent to it.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Strategic Centrality and the Emergence of Core-Periphery Networks#924246
- Strategic Centrality and the Emergence of Core-Periphery Networks#920015
- Clique Number of Tournaments II#984399
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Fair Top-k Katz Centrality via Graph Design#926767
Record · ID 1062738
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive