Tight Bounds for Online Coloring of Basic Graph Classes.
Susanne AlbersSebastian SchrainkPublished in: CoRR (2017)
Keyphrases
- tight bounds
- upper bound
- online learning
- structured data
- real time
- multi objective
- directed graph
- equivalence classes
- graph theoretic
- graph structure
- graph model
- graph based algorithm
- graph partitioning
- undirected graph
- graph databases
- weighted graph
- bipartite graph
- graph matching
- connected components
- evolutionary algorithm