On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3.
Fábio BotlerMaycon SambinelliRafael S. CoelhoOrlando LeePublished in: CoRR (2017)
Keyphrases
- bounded treewidth
- graph structure
- np complete
- upper bound
- search space
- graph matching
- directed graph
- constraint graph
- pattern recognition
- boolean functions
- graph theoretic
- space complexity
- graph model
- graph theory
- series parallel
- theorem prover
- dynamic graph
- graph representation
- graph partitioning
- graph databases
- graph mining
- data sets
- neural network