A better upper bound on the chromatic number of (cap, even-hole)-free graphs.
Yian XuPublished in: Discret. Math. (2021)
Keyphrases
- upper bound
- small number
- lower bound
- databases
- memory requirements
- graph theoretic
- database
- maximum number
- undirected graph
- finite number
- graph matching
- pairwise
- pattern recognition
- bayesian networks
- similarity measure
- case study
- knowledge base
- feature selection
- artificial intelligence
- learning algorithm
- machine learning