[HTML][HTML] Low-exponential algorithm for counting the number of edge cover on simple graphs
JA Hernández-Servín, JR Marcial-Romero… - Computación y …, 2017 - scielo.org.mx
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.
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.
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
G DE ITA LUNA, JR MARCIAL ROMERO… - 2017 - ri.uaemex.mx
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.
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.
Showing the best results for this search. See all results