Gallai's path decomposition conjecture for graphs with treewidth at most 3.
Fábio BotlerMaycon SambinelliRafael S. CoelhoOrlando LeePublished in: J. Graph Theory (2020)
Keyphrases
- bounded treewidth
- space complexity
- search space
- np complete
- structural learning
- upper bound
- graph representation
- shortest path
- constraint graph
- graph theoretic
- graph matching
- boolean functions
- graph databases
- decomposition methods
- decomposition method
- graph mining
- decision problems
- spanning tree
- conjunctive queries
- strongly connected
- constraint satisfaction problems
- finding the shortest path