Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
Avery MillerAndrzej PelcPublished in: SPAA (2016)
Keyphrases
- graph structure
- directed graph
- graph representation
- finding the shortest path
- edge weights
- undirected graph
- random walk
- connected components
- graph model
- overlapping communities
- tree structure
- directed acyclic graph
- weighted graph
- graph theory
- structured data
- neural network
- selection algorithm
- graph construction
- root node
- degree distribution
- betweenness centrality
- heterogeneous social networks