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

Authors

  • Jose Antonio Hernandez-Servin Facultad de Ingenieria, UAEM
  • J. Raymundo Marcial-Romero Facultad de Ingenieria, UAEM
  • Guillermo de Ita Facultad de Ciencias de la Computacion, BUAP

DOI:

https://doi.org/10.13053/cys-21-3-2244

Keywords:

Edge covering, graph theory, integer partition.

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 “low exponential” exact algorithm to count edge covers for simple graphs whose upper bound in the worst case is O(1.465575(m−n) × (m + n)), where m and n are the number of edges and nodes of the input graph, respectively.

Downloads

Published

2016-12-26

Issue

Vol. 21 No. 3 (2017): Thematic issue: Advances in Logic-based Methods for Intelligent Systems (J. C. Nieves, E. Hermann Haeusler, B. Lopes)

Section

Articles of the Thematic Issue

License 

Hereby I transfer exclusively to the Journal "Computación y 
Sistemas", published by the Computing Research Center (CIC-IPN),
the Copyright of the aforementioned paper. I also accept that these 
rights will not be transferred to any other publication, in any other 
format, language or other existing means of developing.
I certify that the paper has not been previously disclosed or simultaneo
usly submitted to any other publication, and that it does not contain 
material whose publication would violate the Copyright or other 
proprietary rights of any person, company or institution. I certify that 
I have the permission from the institution or company where I work or 
study to publish this work.
The representative author accepts the responsibility for the publication
of this paper on behalf of each and every one of the authors. 
This transfer is subject to the following conditions:
  • The authors retain all ownership rights (such as patent rights) of this work, except for the publishing rights transferred to the CIC, through this document.
  • Authors retain the right to publish the work in whole or in part in any book they are the authors or publishers. They can also make use of this work in conferences, courses, personal web pages, and so on.
  • Authors may include working as part of his thesis, for non-profit distribution only.