Polynomial bounds for centered colorings on proper minor-closed graph classes.
Michal PilipczukSebastian SiebertzPublished in: SODA (2019)
Keyphrases
- bounded degree
- upper bound
- equivalence classes
- lower bound
- graph theory
- random walk
- directed graph
- graph structure
- graph mining
- graph representation
- strongly connected components
- bounded treewidth
- upper and lower bounds
- graph theoretic
- directed acyclic graph
- structured data
- worst case
- graph partitioning
- graph data
- spanning tree
- graph patterns