The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
The cover polynomials are bivariate graph polynomials that can be defined as weighted sums over all path-cycle covers of a graph. In , a dichotomy result for the cover polynomials was proven, establishing that their evaluation is #P-hard everywhere but at a finite set of points, where evaluation is in FP. In this paper, we show that almost the same dichotomy holds when restricting the evaluation to planar graphs. We even provide hardness results for planar DAGs of bounded degree. For particular subclasses of planar graphs of bounded degree and for variants thereof, we also provide algorithms that allow for polynomial-time evaluation of the cover polynomials at certain new points by utilizing Valiant’s holographic framework.
Unable to display preview. Download preview PDF.
- 2.Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: FOCS 2008, pp. 677–686 (2008)Google Scholar
- 3.Bläser, M., Dell, H.: Complexity of the cover polynomial. In: ICALP, pp. 801–812 (2007)Google Scholar
- 4.Bläser, M., Dell, H., Fouz, M.: Complexity and approximability of the cover polynomial. Computation Complexity (accepted)Google Scholar
- 6.Bläser, M., Hoffmann, C.: On the complexity of the interlace polynomial. In: Albers, S., Weil, P. (eds.) 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Dagstuhl, Germany, pp. 97–108 (2008)Google Scholar
- 8.Cai, J.-y., Lu, P., Xia, M.: Holographic algorithms with matchgates capture precisely tractable planar #CSP. CoRR abs/1008.0683 (2010)Google Scholar
- 13.Goldberg, L.A., Jerrum, M.: Inapproximability of the Tutte polynomial of a planar graph. CoRR abs/0907.1724 (2009)Google Scholar