Approximate the Clique-Width of a Graph Using Shortest Paths.
J. Leonardo González-RuizJosé Raymundo Marcial-RomeroJosé A. HernándezGuillermo De ItaPublished in: MICAI (2) (2021)
Keyphrases
- shortest path
- weighted graph
- shortest path problem
- finding the shortest path
- flow graph
- path length
- strongly connected components
- betweenness centrality
- maximum weight
- edge weights
- graph search
- minimum cut
- random walk
- shortest path algorithm
- road network
- maximum clique
- graph properties
- dynamic programming
- minimal surface
- directed graph
- optimal path
- graph partitioning
- travel time
- minimum cost flow
- quasi cliques
- markov random field
- graph structure
- graph theory
- bipartite graph
- complex networks