Lower Bounds for On-line Graph Colorings.
Grzegorz GutowskiJakub KozikPiotr MicekXuding ZhuPublished in: ISAAC (2014)
Keyphrases
- lower bound
- upper bound
- min sum
- random walk
- graph representation
- branch and bound algorithm
- lower and upper bounds
- directed graph
- branch and bound
- graph theory
- graph theoretic
- bipartite graph
- weighted graph
- graph mining
- objective function
- spanning tree
- worst case
- graph structure
- structured data
- np hard
- directed acyclic graph
- graph databases
- connected components
- vc dimension
- constraint satisfaction problems
- max sat
- quadratic assignment problem
- graph coloring
- constant factor
- optimal cost
- graph based algorithm