A Novel Method for Counting Independent Sets in a Grid Graph

被引：0
|
作者：
De Ita Luna, Guillermo [1 ]
Vidal, Mireya Tovar [1 ]
Loranca, Beatriz Bernabe [1 ]
机构：
[1] Benemerita Univ Autonoma Puebla, Fac Ciencias Comp, Puebla, Mexico
来源：
INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS | 2023年 / 14卷 / 01期
关键词：
Counting independent sets; Grid graph; Transfer matrix; Fibonacci recurrence; SPARSE; COMPLEXITY;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：11 / 18
页数：8
相关论文
共 50 条
  • [1] Counting Rules for Computing the Number of Independent Sets of a Grid Graph
    De Ita Luna, Guillermo
    Bello Lopez, Pedro
    Marcial-Romero, Raymundo
    MATHEMATICS, 2024, 12 (06)
  • [2] Counting independent sets in a tolerance graph
    Lin, Min-Sheng
    Su, Sheng-Huang
    DISCRETE APPLIED MATHEMATICS, 2015, 181 : 174 - 184
  • [3] Maximal independent sets on a grid graph
    Oh, Seungsang
    DISCRETE MATHEMATICS, 2017, 340 (12) : 2762 - 2768
  • [4] The number of independent sets in a grid graph
    Calkin, NJ
    Wilf, HS
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (01) : 54 - 60
  • [5] Improved mixing condition on the grid for counting and sampling independent sets
    Ricardo Restrepo
    Jinwoo Shin
    Prasad Tetali
    Eric Vigoda
    Linji Yang
    Probability Theory and Related Fields, 2013, 156 : 75 - 99
  • [6] COUNTING MAXIMAL DISTANCE-INDEPENDENT SETS IN GRID GRAPHS
    Euler, Reinhardt
    Oleksik, Pawel
    Skupien, Zdzislaw
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (03) : 531 - 557
  • [7] Improved mixing condition on the grid for counting and sampling independent sets
    Restrepo, Ricardo
    Shin, Jinwoo
    Tetali, Prasad
    Vigoda, Eric
    Yang, Linji
    PROBABILITY THEORY AND RELATED FIELDS, 2013, 156 (1-2) : 75 - 99
  • [8] Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets
    Restrepo, Ricardo
    Shin, Jinwoo
    Tetali, Prasad
    Vigoda, Eric
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 140 - 149
  • [9] Approximately counting independent sets in bipartite graphs via graph containers
    Jenssen, Matthew
    Potukuchi, Aditya
    Perkins, Will
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 499 - 516
  • [10] Approximately counting independent sets in bipartite graphs via graph containers
    Jenssen, Matthew
    Perkins, Will
    Potukuchi, Aditya
    RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (01) : 215 - 241
12345