Approximating pathwidth for graphs of small treewidth.
Carla GroenlandGwenaël JoretWojciech NadaraBartosz WalczakPublished in: CoRR (2020)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- boolean functions
- conjunctive queries
- np hard
- graph theory
- small number
- upper bound
- relational databases
- search algorithm
- random walk
- neural network
- directed graph
- graph matching
- probability distribution
- graph structure
- graph databases
- undirected graph
- graph theoretic
- social networks