An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs.
Edita MácajováJán MazákPublished in: FAW-AAIM (2011)
Keyphrases
- optimal solution
- dynamic programming
- worst case
- np hard
- undirected graph
- computational complexity
- k means
- graph structure
- detection algorithm
- computational cost
- preprocessing
- search space
- objective function
- weighted graph
- expectation maximization
- globally optimal
- hyper graph
- learning algorithm
- b spline
- graph model
- lower bound
- edge weights
- random graphs
- vertex set
- conflict free
- similarity measure