The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs.
Fatemeh Keshavarz-KohjerdiRuo-Wei HungPublished in: CoRR (2019)
Keyphrases
- strongly connected
- shortest path
- graph matching
- graph theory
- graph databases
- graph mining
- topological information
- finding the shortest path
- neural network
- topological features
- graph representation
- graph structure
- directed graph
- lower bound
- optimal path
- small world
- random graphs
- connected components
- pairwise
- search algorithm