Optimal path and cycle decompositions of dense quasirandom graphs.
Stefan GlockDaniela KühnDeryk OsthusPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- optimal path
- path planning
- shortest path
- route planning
- dijkstra algorithm
- path planning algorithm
- weighted graph
- graph matching
- quasi cliques
- singular value decomposition
- graph theoretic
- graph model
- labeled graphs
- graph clustering
- graph representation
- data sets
- graph structure
- graph theory
- dynamic environments
- optimal solution
- graph mining
- collision free
- series parallel