Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor.
Édouard BonnetJedrzej HodorTuukka KorhonenTomás MasaríkPublished in: CoRR (2023)
Keyphrases
- bounded treewidth
- random graphs
- low degree
- planar graphs
- graph structure
- upper bound
- np complete
- boolean functions
- space complexity
- graph theoretic
- graph databases
- maximum number
- graph matching
- subgraph isomorphism
- search space
- constraint graph
- graph mining
- bayesian networks
- graph theory
- graph clustering
- directed graph
- decision problems
- degree distribution
- search algorithm