Complexity of the cover polynomial

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 801-812

  Bläser, Markus ^a   Dell, Holger ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTERPOLATION; TURING MACHINES;

DISJOINT DIRECTED CYCLES; TURING REDUCTIONS;

POLYNOMIALS;

EID: 38149107503     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_69     Document Type: Conference Paper

References (12)

1. Chung, F.R., Graham, R.L.: On the cover polynomial of a digraph. Journal of Combinatorial Theory Series B 65, 273-290 (1995)
2. Jaeger, F., Vertigan, D.L., Welsh, D.J.: On the computational complexity of the Jones and Tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society 108, 35-53 (1990)
3. Lotz, M., Makowsky, J. A.: On the algebraic complexity of some families of coloured Tutte polynomials. Advances in Applied Mathematics 32, 327-349 (2004)
4. Bollobás, B., Riordan, O.: A Tutte polynomial for coloured graphs. Combinatorics, Probability and Computing 8, 45-93 (1999)
5. Giménez, O., Noy, M.: On the complexity of computing the Tutte polynomial of bicircular matroids. Combinatorics, Probability and Computing 15, 385-395 (2006)
6. Goldberg, L.A., Jerrum, M.: Inapproximability of the Tutte polynomial (2006)
7. Bulatov, A., Grohe, M.: The complexity of partition functions. Theoretical Computer Science 348, 148-186 (2005)
8. Dyer, M.E., Goldberg, L.A., Paterson, M.: On counting homomorphisms to directed acyclic graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 38-49. Springer, Heidelberg (2006)
9. Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8, 189-201 (1979)
10. D'Antona, O.M., Munarini, E.: The cycle-path indicator polynomial of a digraph. Adv. Appl. Math. 25, 41-56 (2000)
11. Bläser, M., Dell, H.: Complexity of the cover polynomial (journal version) (to appear)
12. Dyer, M.E., Frieze, A.M., Jerrum, M.: Approximately counting Hamilton paths and cycles in dense graphs. SIAM Journal on Computing 27, 1262-1272 (1998)