A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model.
Bahman BahmaniAranyak MehtaRajeev MotwaniPublished in: SODA (2010)
Keyphrases
- mathematical model
- probabilistic model
- hyper graph
- graph model
- recognition algorithm
- theoretical analysis
- weighted graph
- objective function
- cost function
- classification algorithm
- detection algorithm
- expectation maximization
- operating point
- graph based algorithm
- bayesian framework
- segmentation algorithm
- input data
- similarity measure
- dynamic programming
- np hard
- k means
- minimum spanning tree
- fully connected
- spanning tree
- computational complexity
- em algorithm
- optimal solution
- tree structure
- adjacency graph
- energy function
- worst case
- maximum flow
- neural network
- search space
- graph representation
- graph partitioning
- undirected graph
- graph theory
- probability distribution
- graphical models
- random walk