<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462017000300449</article-id>
<article-id pub-id-type="doi">10.13053/cys-21-3-2244</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Hernández-Servín]]></surname>
<given-names><![CDATA[José A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Marcial-Romero]]></surname>
<given-names><![CDATA[J. Raymundo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ita Luna]]></surname>
<given-names><![CDATA[Guillermo De]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma del Estado de México  ]]></institution>
<addr-line><![CDATA[Toluca ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla  ]]></institution>
<addr-line><![CDATA[Puebla ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2017</year>
</pub-date>
<volume>21</volume>
<numero>3</numero>
<fpage>449</fpage>
<lpage>456</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462017000300449&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462017000300449&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462017000300449&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: A procedure for counting edge covers of simple graphs is presented. The procedure splits simple graphs into non-intersecting cycle graphs. This is a &#8220;low exponential&#8221; exact algorithm to count edge covers for simple graphs whose upper bound in the worst case is O(1.465575(m&#8722;n) × (m + n)), where m and n are the number of edges and nodes of the input graph, respectively.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Edge covering]]></kwd>
<kwd lng="en"><![CDATA[graph theory]]></kwd>
<kwd lng="en"><![CDATA[integer partition]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Akbari]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Oboudi]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the edge cover polynomial of a graph]]></article-title>
<source><![CDATA[Eur. J. Comb.]]></source>
<year>2013</year>
<volume>34</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>297-321</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bezáková]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Rummler]]></surname>
<given-names><![CDATA[W. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Královic]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Niwinski]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Sampling edge covers in 3-regular graphs]]></source>
<year>2009</year>
<volume>5734</volume>
<conf-name><![CDATA[ Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009]]></conf-name>
<conf-date>August 24-28, 2009</conf-date>
<conf-loc>Novy Smokovec, High Tatras, Slovakia </conf-loc>
<page-range>137-48</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bondy]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Murty]]></surname>
<given-names><![CDATA[U. S. R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graph theory]]></source>
<year>2008</year>
<volume>244</volume>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bubley]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Dyer]]></surname>
<given-names><![CDATA[M. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Saks]]></surname>
<given-names><![CDATA[M. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graph orientations with no sink and an approximation for a hard case of #sat]]></source>
<year>1997</year>
<conf-name><![CDATA[ Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms]]></conf-name>
<conf-date>5-7 January 1997</conf-date>
<conf-loc>New Orleans, Louisiana </conf-loc>
<page-range>248-57</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dahllöf]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Jonsson]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Wahlström]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ibarra]]></surname>
<given-names><![CDATA[O. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Counting satisfying assignments in 2-sat and 3-sat]]></source>
<year>2002</year>
<volume>2387</volume>
<conf-name><![CDATA[ Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings]]></conf-name>
<conf-loc> </conf-loc>
<page-range>535-43</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Darwiche]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the tractable counting of theory models and its application to belief revision and truth maintenance]]></article-title>
<source><![CDATA[CoRR]]></source>
<year>2000</year>
<volume>cs.AI/0003044</volume>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grohe]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Marx]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Constraint solving via fractional edge covers]]></source>
<year>2006</year>
<conf-name><![CDATA[ Proceedings of the Seven-teenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006]]></conf-name>
<conf-date>January 22-26, 2006</conf-date>
<conf-loc>Miami, Florida, USA </conf-loc>
<page-range>289-98</page-range><publisher-name><![CDATA[ACM Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A dichotomy for real weighted holant problems]]></source>
<year>2012</year>
<conf-name><![CDATA[ IEEE Conference on Computational Complexity]]></conf-name>
<conf-loc> </conf-loc>
<page-range>96-106</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jin-Yi Cai]]></surname>
<given-names><![CDATA[H. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Williams]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A complete dichotomy rises from the capture of vanishing signatures: extended abstract]]></article-title>
<source><![CDATA[STOC]]></source>
<year>2013</year>
<page-range>635-44</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jin-YI Cai]]></surname>
<given-names><![CDATA[P. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Xia]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Holant problems and counting csp]]></source>
<year>2009</year>
<conf-name><![CDATA[ Proceeding of the 41st annual ACM symposium on THeory of computing, STOC 09]]></conf-name>
<conf-loc>New York, USA </conf-loc>
<page-range>715-24</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jin-YI Cai]]></surname>
<given-names><![CDATA[P. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Xia]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computational complexity of holant problems]]></article-title>
<source><![CDATA[SIAM J. Comput.]]></source>
<year>2011</year>
<volume>40</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1101-32</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kavitha]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Liebchen]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Mehlhorn]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Michail]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Rizzi]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ueckerdt]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Zweig]]></surname>
<given-names><![CDATA[K. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Cycle bases in graphs characterization, algorithms, complexity, and applications]]></article-title>
<source><![CDATA[Computer Science Review]]></source>
<year>2009</year>
<volume>3</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>199-243</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A simple FPTAS for counting edge covers]]></article-title>
<source><![CDATA[CoRR]]></source>
<year>2013</year>
<volume>abs/1309.6115</volume>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Schulz]]></surname>
<given-names><![CDATA[A. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Wagner]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[FPTAS for counting weighted edge covers]]></source>
<year>2014</year>
<volume>8737</volume>
<conf-name><![CDATA[ Algorithms - ESA 2014 - 22th Annual European Symposium]]></conf-name>
<conf-date>September 8-10, 2014</conf-date>
<conf-loc>Wroclaw, Poland </conf-loc>
<page-range>654-65</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Luna]]></surname>
<given-names><![CDATA[G. D. I.]]></given-names>
</name>
<name>
<surname><![CDATA[Marcial-Romero]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Venegas]]></surname>
<given-names><![CDATA[H. A. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Estimating the relevance on communication lines based on the number of edge covers]]></article-title>
<source><![CDATA[Electronic Notes in Discrete Mathematics]]></source>
<year>2010</year>
<volume>36</volume>
<page-range>247-54</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Padó]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lapata]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Calzolari]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Cardie]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Isabelle]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimal constituent alignment with edge covers for semantic projection]]></source>
<year>2006</year>
<conf-name><![CDATA[ ACL 2006, 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference]]></conf-name>
<conf-date>17-21 July 2006</conf-date>
<conf-loc>Sydney, Australia </conf-loc>
<page-range>1161-8</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Roth]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the hardness of approximate reasoning]]></article-title>
<source><![CDATA[Artif. Intell.]]></source>
<year>1996</year>
<volume>82</volume>
<numero>1-2</numero>
<issue>1-2</issue>
<page-range>273-302</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vadhan]]></surname>
<given-names><![CDATA[S. P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The complexity of counting in sparse, regular, and planar graphs]]></article-title>
<source><![CDATA[SIAM J. Comput.]]></source>
<year>2001</year>
<volume>31</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>398-427</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
