FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES
2009 ◽
Vol 20
(01)
◽
pp. 25-44
◽
Keyword(s):
We prove # P -completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O *(1.8494m) time for 3-regular graphs, and O *(1.9706m) time for unit interval graphs, where m is the number of edges in the graph and O *-notation ignores a polynomial factor. The algorithms can be generalized to the Tutte polynomial computation.
2006 ◽
pp. 148-159
◽
2012 ◽
Vol 04
(03)
◽
pp. 1250039
2009 ◽
Vol 6
(1)
◽
pp. 1-21
◽
2018 ◽
Keyword(s):
1999 ◽
Vol Vol. 3 no. 4
◽
2012 ◽
pp. 360-372
◽
2020 ◽
Vol 7
(3)
◽
pp. 1453-1465
◽