A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices.
Rhyd LewisPublished in: ICCL (2020)
Keyphrases
- shortest path algorithm
- shortest path
- weighted graph
- edge weights
- optimal solution
- undirected graph
- random graphs
- labeled graphs
- attributed graphs
- betweenness centrality
- minimum cost flow
- adjacency matrix
- total cost
- query graph
- connected subgraphs
- hamiltonian cycle
- minimum weight
- maximal cliques
- directed edges
- maximum cardinality
- transfer learning
- planar graphs
- graph matching
- graph clustering
- graph partitioning
- directed graph
- random walk
- graph structure
- average degree
- vertex set
- expected cost
- subgraph isomorphism
- graph structures
- graph theoretic
- neural network
- cross domain
- graph model
- bipartite graph
- graph search