Optimal path and cycle decompositions of dense quasirandom graphs.
Stefan GlockDaniela KühnDeryk OsthusPublished in: J. Comb. Theory, Ser. B (2016)
Keyphrases
- optimal path
- path planning
- shortest path
- route planning
- path planning algorithm
- graph structure
- dijkstra algorithm
- quasi cliques
- graph theory
- weighted graph
- data sets
- graph theoretic
- spanning tree
- graph matching
- random graphs
- graph databases
- graph construction
- decomposition methods
- subgraph isomorphism
- series parallel
- directed graph
- optimal solution
- graph partitioning
- graph kernels
- densely connected