A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas

López, Marco A.; Marcial‐Romero, J. Raymundo; Luna, Guillermo De Ita; Moyao, Yolanda

doi:10.1007/978-3-319-92198-3_8

Cited by 4 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the previous section, it has been shown how the computation of i(G p ) for the fundamental prime graph G p can be achieved in linear time with respect to its number of edges. This is possible because these fundamental prime graphs can be considered as outerplanar graphs, as mentioned in [22,23]. Let k = (n − 1) • (m − 1) be the number of internal square faces of the input grid G m,n , and let H(B G ) = {G p : G p represent the graph linked to a leaf node in the enumerative tree.}.…”

mentioning

confidence: 99%

Counting Rules for Computing the Number of Independent Sets of a Grid Graph

De Ita Luna,

Bello López,

Marcial-Romero

2024

Mathematics

View full text Add to dashboard Cite

The issue of counting independent sets of a graph, G, represented as i(G), is a significant challenge within combinatorial mathematics. This problem finds practical applications across various fields, including mathematics, computer science, physics, and chemistry. In chemistry, i(G) is recognized as the Merrifield–Simmons (M-S) index for molecular graphs, which is one of the most relevant topological indices related to the boiling point in chemical compounds. This article introduces an innovative algorithm designed for tallying independent sets within grid-like structures. The proposed algorithm is based on the ‘branch-and-bound’ technique and is applied to compute i(Gm,n) for a square grid formed by m rows and n columns. The proposed approach incorporates the widely recognized vertex reduction rule as the basis for splitting the current subgraph. The methodology involves breaking down the initial grid iteratively until outerplanar graphs are achieved, serving as the ’basic cases’ linked to the leaf nodes of the computation tree or when no neighborhood is incident to a minimum of five rectangular internal faces. The time complexity of the branch-and-bound algorithm speeds up the computation of i(Gm,n) compared to traditional methods, like the transfer matrix method. Furthermore, the scope of the proposed algorithm is more general than the algorithms focused on grids since it could be applied to process general mesh graphs.

show abstract

mentioning

confidence: 99%

Counting Rules for Computing the Number of Independent Sets of a Grid Graph

De Ita Luna,

Bello López,

Marcial-Romero

2024

Mathematics

View full text Add to dashboard Cite

show abstract

“…We have shown that, for the basic prime graph G p , i(G p ) can be computed in linear time regarding its number of edges, since we can consider those basic prime graphs as outerplanar graphs [16,17]. Let us define H(E G ) = {G p : G p is the graph associated to a leaf node of the previous enumerative tree.…”

mentioning

confidence: 99%