An algorithm which outputs a graph with a specified chromatic factor.
Daniel DelbourgoKerri MorganPublished in: Discret. Appl. Math. (2019)
Keyphrases
- k means
- objective function
- learning algorithm
- high accuracy
- optimal solution
- dynamic programming
- cost function
- experimental evaluation
- graph structure
- search space
- preprocessing
- computational cost
- times faster
- segmentation algorithm
- detection algorithm
- graph based algorithm
- shortest path problem
- recognition algorithm
- minimum spanning tree
- matching algorithm
- clustering method
- optimization algorithm
- worst case
- significant improvement
- random walk
- tree structure
- linear programming
- probabilistic model
- weighted graph
- graph model
- graph representation
- edge weights
- computational complexity
- similarity measure
- breadth first search
- neural network