Login / Signup
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth.
Pengfei Wan
Jianhua Tu
Shenggui Zhang
Binlong Li
Published in:
Appl. Math. Comput. (2018)
Keyphrases
</>
bounded treewidth
np complete
conjunctive queries
decision problems
relational learning
highly parallelizable
boolean functions
fixed parameter tractable
np hard
maximum cardinality
database
databases
information retrieval
computational complexity
optimal policy