On the Maximum Diameter of Path-Pairable Graphs.
António GirãoKamil PopielarzGábor MészárosRichard SnyderPublished in: Graphs Comb. (2019)
Keyphrases
- shortest path
- graph matching
- maximum distance
- graph theoretic
- average degree
- directed graph
- graph theory
- weighted graph
- finding the shortest path
- neural network
- graph databases
- graph mining
- adjacency matrix
- graph clustering
- graph structure
- graph representation
- graph partitioning
- optimal path
- endpoints
- strongly connected
- bipartite graph
- graphical models
- learning algorithm