Graphs of bounded twin-width are quasi-polynomially χ-bounded.
Michal PilipczukMarek SokolowskiPublished in: CoRR (2022)
Keyphrases
- polynomially bounded
- graph matching
- subgraph isomorphism
- graph theoretic
- graph mining
- graph structure
- case study
- graph theory
- weighted graph
- graph databases
- complex structures
- graph theoretical
- decision trees
- database
- graph representation
- information systems
- machine learning
- bounded treewidth
- series parallel
- data sets