Bounded twin-width graphs are polynomially χ-bounded.
Romain BourneufStéphan ThomasséPublished in: CoRR (2023)
Keyphrases
- polynomially bounded
- series parallel
- graph mining
- bounded treewidth
- directed graph
- graph matching
- structured objects
- machine learning
- real time
- bipartite graph
- graph theoretical
- graph construction
- graph theoretic
- graph partitioning
- weighted graph
- graph theory
- probabilistic model
- lower bound
- pattern recognition
- search engine
- genetic algorithm
- neural network
- databases