#3-regular bipartite planar vertex cover is #P-complete

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

Volumn 3959 LNCS, Issue , 2006, Pages 356-364

  Xia, Mingji ^a   Zhao, Wenbo ^b  

^a INSTITUTE OF SOFTWARE   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; INTERPOLATION; MATHEMATICAL MODELS;

BIPARTITE PLANAR VERTEX; POLYNOMIAL INTERPOLATION;

POLYNOMIALS;

EID: 33745833101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11750321_34     Document Type: Conference Paper

References (7)

1. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, R. E. Stearns: The Complexity of Planar Counting Problems. SIAM J. Comput. 27 (1998) 1142-1167
2. M. Liskiewicz, M. Ogihara, S. Toda: The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304 (2003) 129-156
3. C. S. Greenhill: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity 9 (2000) 52-72
4. C. Papadimitriou: Computational Complexity. Addison-Wesley 1994
5. S. P. Vadhan: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing 31 (2001) 398-427
6. L. G. Valiant: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8 (1979) 410-421
7. L. G. Valiant: Holographic Algorithms (Extended Abstract). FOCS (2004) 306-315