Sparse Outerstring Graphs Have Logarithmic Treewidth.
Shinwoo AnEunjin OhJie XuePublished in: CoRR (2024)
Keyphrases
- bounded treewidth
- search space
- graph matching
- directed acyclic
- upper bound
- constraint graph
- sparse data
- graph theoretic
- graph structure
- high dimensional
- worst case
- np complete
- random graphs
- space complexity
- graph model
- tree decompositions
- graph representation
- graph mining
- boolean functions
- conjunctive queries
- decision problems
- constraint satisfaction problems
- constraint propagation
- compressive sensing
- subgraph isomorphism
- sparse matrix
- random walk
- knn
- gaussian graphical models
- probability distribution