Counting independent sets in graphs with bounded bipartite pathwidth.
Martin E. DyerCatherine S. GreenhillHaiko MüllerPublished in: Random Struct. Algorithms (2021)
Keyphrases
- bounded treewidth
- bipartite graph
- graph model
- graph partitioning
- np complete
- undirected graph
- real valued
- graph theoretic
- decision problems
- graph matching
- graph mining
- pattern recognition
- graph representation
- conjunctive queries
- directed graph
- boolean functions
- spanning tree
- pairwise
- computational complexity
- edge weights
- neural network
- vertex set