Counting and Enumeration Problems with Bounded Treewidth

@inproceedings{Pichler2010CountingAE,
  title={Counting and Enumeration Problems with Bounded Treewidth},
  author={Reinhard Pichler and Stefan R{\"u}mmele and Stefan Woltran},
  booktitle={LPAR},
  year={2010}
}
By Courcelle’s Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. This result was extended to counting problems by Arnborg et al. and to enumeration problems by Flum et al. Despite the undisputed importance of these results for proving fixed-parameter tractability, they do not directly yield implementable algorithms. Recently, Gottlob et al. presented a new approach using monadic datalog… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Similar Papers

Loading similar papers…