2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs.
Petra SparlJanez ZerovnikPublished in: Inf. Process. Lett. (2004)
Keyphrases
- times faster
- dynamic programming
- k means
- learning algorithm
- neural network
- experimental evaluation
- objective function
- computational complexity
- computational cost
- high accuracy
- graph isomorphism
- minimum spanning tree
- spanning tree
- theoretical analysis
- np hard
- cost function
- optimal solution
- finding the shortest path
- probabilistic model
- image segmentation
- distance transformation
- regular grid
- random graphs
- undirected graph
- search space
- weighted graph
- graph structure
- convergence rate
- significant improvement
- matching algorithm
- linear programming