Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs

No abstract is available for this paper.

• Publication year

  2014

• Venue

  LANMR

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.13053/cys-21-3-2244
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• FPTAS for Counting Weighted Edge Covers

  2014cited by this paper
• On the edge cover polynomial of a graph

  2013cited by this paper
• A Simple FPTAS for Counting Edge Covers

  2013cited by this paper
• A Dichotomy for Real Weighted Holant Problems

  2012cited by this paper
• A complete dichotomy rises from the capture of vanishing signatures: extended abstract

  2012cited by this paper
• Computational Complexity of Holant Problems

  2011cited by this paper
• Estimating the relevance on Communication Lines Based on the Number of Edge Covers

  2010influential reference
• Sampling Edge Covers in 3-Regular Graphs

  2009cited by this paper
• Cycle bases in graphs characterization, algorithms, complexity, and applications

  2009cited by this paper
• Holant problems and counting CSP

  2009cited by this paper
• Graph Theory

  2008cited by this paper
• Optimal Constituent Alignment with Edge Covers for Semantic Projection

  2006cited by this paper
• Constraint solving via fractional edge covers

  2006cited by this paper
• The Complexity of Counting in Sparse, Regular, and Planar Graphs

  2002cited by this paper
• Counting Satisfying Assignments in 2-SAT and 3-SAT

  2002cited by this paper
• On the tractable counting of theory models and its application to belief revision and truth maintenance

  2000cited by this paper
• Graph orientations with no sink and an approximation for a hard case of #SAT

  1997influential reference
• On the Hardness of Approximate Reasoning

  1993cited by this paper
• Graduate Texts in Mathematics

  1982cited by this paper

• Implementación de un método para generar coberturas de aristas en grafos simples.

  2017influential citation