Election vs. Selection: Two Ways of Finding the Largest Node in a Graph.
Avery MillerAndrzej PelcPublished in: CoRR (2014)
Keyphrases
- graph structure
- directed graph
- strongly connected
- undirected graph
- random walk
- graph databases
- maximum clique
- graph representation
- finding the shortest path
- betweenness centrality
- graph mining
- root node
- graph theoretic
- connected components
- nodes of a graph
- edge weights
- spanning tree
- graph theory
- selection algorithm
- graph partitioning
- degree distribution
- bipartite graph