Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.
Antoine AmarilliMikaël MonetPublished in: MFCS (2022)
Keyphrases
- bounded treewidth
- weighted graph
- graph structure
- graph model
- maximum cardinality
- graph theory
- maximum weight
- np complete
- edge weights
- search space
- directed graph
- random walk
- upper bound
- graph representation
- connected components
- directed acyclic graph
- search algorithm
- spectral graph
- minimum weight
- graph theoretic
- space complexity
- special case
- bipartite graph