View source for Undirected All-Nodes Positive Betweenness Centrality

{{DISPLAYTITLE:Undirected All-Nodes Positive Betweenness Centrality (Vertex Centrality)}}
== Description == 

Given an undirected 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]], [[Directed 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 == 

{| class="wikitable sortable"  style="text-align:center;" width="100%"

! Problem !! Implication !! Year !! Citation !! Reduction

|-

| [[Undirected, Weighted APSP]] ||  style="text-align:left;" | if: to-time: Truly subcubic<br/>then: from-time: Truly subcubic || 2015 || https://epubs-siam-org.ezproxy.canberra.edu.au/doi/10.1137/1.9781611973730.112, Corollary 4.1 || [[Reduction from Undirected, Weighted APSP to Undirected All-Nodes Positive Betweenness Centrality|link]]
|-
|}