281 search results - page 1 / 57 » The Complexity of Planar Counting Problems |
CORR
1998
Springer
13 years 5 months ago
1998
Springer
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
CP
2008
Springer
13 years 7 months ago
2008
Springer
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
