Directed All-Nodes Positive Betweenness Centrality (Vertex Centrality)
Revision as of 11:28, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Directed All-Nodes Positive Betweenness Centrality (Vertex Centrality)}} == Description == Given a directed graph, determine whether the betweenness centrality of all nodes is positive. == Related Problems == Generalizations: Positive Betweenness Centrality Related: Eccentricity, All-Nodes Median Parity, Betweenness Centrality, Approximate Betweenness Centrality, Undirected All-Nodes Positive Betweenness Centrality, Reach Ce...")
Description
Given a directed graph, determine whether the betweenness centrality of all nodes is positive.
Related Problems
Generalizations: Positive Betweenness Centrality
Related: Eccentricity, All-Nodes Median Parity, Betweenness Centrality, Approximate Betweenness Centrality, Undirected All-Nodes Positive Betweenness Centrality, Reach Centrality, Directed All-Nodes Reach Centrality, Undirected All-Nodes Reach Centrality, Approximate Reach Centrality
Parameters
n: number of nodes m: number of edges
Table of Algorithms
Currently no algorithms in our database for the given problem.
Reductions FROM Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| Directed, Weighted APSP | if: to-time: Truly subcubic then: from-time: Truly subcubic |
2015 | https://epubs.siam.org/doi/10.1137/1.9781611973730.112, Corollary 4.1 | link |