A Novel Method for Counting Independent Sets in a Grid Graph

The problem of counting independent sets of a graph G is not only mathematically relevant and interesting, but also has many applications in physics, mathematics, and theoretical computer science. In this paper, a novel method for counting independent sets on grid-like structures is presented. It st...

Full description

Saved in:
Bibliographic Details
Published inInternational Journal of Combinatorial Optimization Problems and Informatics Vol. 14; no. 1; p. 11
Main Authors Guillermo De Ita Luna, Mireya Tovar Vidal, Bernábe-Loranca, Maria Beatriz
Format Journal Article
LanguageEnglish
Published Jiutepec International Journal of Combinatorial Optimization Problems & Informatics 01.01.2023
Subjects
Algorithms
Approximation
Computer science
Graphs
Informatics
Markov analysis
Neighborhoods
Optimization
Topology
Transfer matrices
Online AccessGet full text

Cover

More Information
Summary:The problem of counting independent sets of a graph G is not only mathematically relevant and interesting, but also has many applications in physics, mathematics, and theoretical computer science. In this paper, a novel method for counting independent sets on grid-like structures is presented. It starts by explaining the recurrences used by the method to count independent sets on basic topologies of graphs. The method is extended to process grid-like structures of quadratic faces. The proposal has a lower time complexity than the required on the leading and current method based on the transfer matrix for counting independent sets on grids.
ISSN:2007-1558