The problem of path decomposition for graphs with treewidth at most 4.
Changhong LuNiping YiPublished in: Discret. Math. (2024)
Keyphrases
- bounded treewidth
- structural learning
- shortest path
- search space
- upper bound
- graph structure
- space complexity
- constraint graph
- graph matching
- directed graph
- np complete
- weighted graph
- decomposition method
- graph databases
- boolean functions
- decomposition algorithm
- graph representation
- graph theory
- decomposition methods
- worst case
- minimum cost
- relational databases
- endpoints
- tree decomposition
- subgraph isomorphism
- probabilistic model
- finding the shortest path
- tree decompositions