Computing a graph's period quadratically by node condensation.
Yves BalcerArthur F. Veinott Jr.Published in: Discret. Math. (1973)
Keyphrases
- graph structure
- directed graph
- undirected graph
- graph theory
- bipartite graph
- homology generators
- nodes of a graph
- overlapping communities
- path length
- connected components
- strongly connected
- edge weights
- graph representation
- root node
- random walk
- graph theoretic
- spanning tree
- betweenness centrality
- finding the shortest path
- graph mining