Tight Bounds for Online Coloring of Basic Graph Classes.
Susanne AlbersSebastian SchrainkPublished in: Algorithmica (2021)
Keyphrases
- tight bounds
- upper bound
- online learning
- random walk
- graph theory
- graph structure
- real time
- online environment
- equivalence classes
- genetic algorithm
- stable set
- graph structures
- graph construction
- spanning tree
- graph model
- connected components
- structured data
- search algorithm
- graph representation
- directed acyclic graph
- graph search
- image segmentation
- graph based algorithm
- web pages