Neuromorphic Graph Algorithms: Extracting Longest Shortest Paths and Minimum Spanning Trees.
Bill KayPrasanna DateCatherine D. SchumanPublished in: NICE (2020)
Keyphrases
- shortest path
- minimum spanning trees
- minimum spanning tree
- edge weights
- shortest path algorithm
- weighted graph
- strongly connected components
- graph theory
- minimum cost flow
- betweenness centrality
- spanning tree
- data clustering
- directed acyclic graph
- geodesic distance
- random walk
- maximum flow
- flow graph
- finding the shortest path