Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types.
Zsolt TuzaVitaly I. VoloshinPublished in: Comput. Sci. J. Moldova (2003)
Keyphrases
- undirected graph
- optimal solution
- cost function
- detection algorithm
- weighted graph
- k means
- computational complexity
- edge weights
- preprocessing
- np hard
- graph structure
- simulated annealing
- expectation maximization
- spanning tree
- graph model
- matching algorithm
- graph based algorithm
- dynamic programming
- objective function
- random walk
- social networks
- directed graph
- bipartite graph
- markov random field
- worst case
- probabilistic model
- search space
- minimum weight
- strongly connected
- minimum length
- similarity measure