De Ita et al., 2023 - Google Patents
A Branch and Bound Algorithm for Counting Independent Sets on Grid GraphsDe Ita et al., 2023
View HTML- Document ID
- 5431495793574158249
- Author
- De Ita G
- Bello P
- Tovar M
- Publication year
- Publication venue
- Computer Sciences & Mathematics Forum
External Links
Snippet
A relevant problem in combinatorial mathematics is the problem of counting independent sets of a graph G, denoted by i (G). This problem has many applications in combinatorics, physics, chemistry and computer science. For example, in statistical physics, the …
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30587—Details of specialised database models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/21—Text processing
- G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30908—Information retrieval; Database structures therefor; File system structures therefor of semistructured data, the undelying structure being taken into account, e.g. mark-up language structure data
- G06F17/30914—Mapping or conversion
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
- G06F17/30321—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
- G06Q10/063—Operations research or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/21—Text processing
- G06F17/24—Editing, e.g. insert/delete
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
- G06F19/28—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for programming tools or database systems, e.g. ontologies, heterogeneous data integration, data warehousing or computing architectures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for a specific business sector, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/22—Health care, e.g. hospitals; Social work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for a specific business sector, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/20—Education
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for a specific business sector, e.g. utilities or tourism
- G06Q50/01—Social networking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/30—Medical informatics, i.e. computer-based analysis or dissemination of patient or disease data
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Kumduang et al. | Semigroups of terms, tree languages, Menger algebra of n-ary functions and their embedding theorems | |
Staš | Determining crossing number of join of the discrete graph with two symmetric graphs of order five | |
Shi et al. | A new optimization model for the sustainable development: Quadratic knapsack problem with conflict graphs | |
Choo | Relations between generalized bi-periodic Fibonacci and Lucas sequences | |
Jiang et al. | The retentivity of four kinds of shadowing properties in non-autonomous discrete dynamical systems | |
Chen et al. | Characterization of symmetry of complex networks | |
Subramanian et al. | Existence and UH Stability Results for Nonlinear Coupled Fractional Differential Equations with Boundary Conditions Involving Riemann–Liouville and Erdélyi–Kober Integrals | |
Rao et al. | On the planarity of graphs associated with symmetric and pseudo symmetric numerical semigroups | |
De Ita et al. | A Branch and Bound Algorithm for Counting Independent Sets on Grid Graphs | |
Moshkov | Decision trees for binary subword-closed languages | |
De Ita Luna et al. | Counting rules for computing the number of independent sets of a grid graph | |
Farooq | Noether-Like operators and first integrals for generalized systems of Lane-Emden equations | |
An et al. | Generalized abel-grassmann’s neutrosophic extended triplet loop | |
Adineh Zadeh et al. | A comparison of complete parts on m-idempotent hyperrings | |
Mufti et al. | Entropy and Multi-Fractal Analysis in Complex Fractal Systems Using Graph Theory | |
Bai et al. | Design Efficiency of the Asymmetric Minimum Projection Uniform Designs | |
Azam et al. | An efficient algorithm to count tree-like graphs with a given number of vertices and self-loops | |
Zhao et al. | A Vulnerability Measure of k-Uniform Linear Hypergraphs | |
Kansal et al. | On Another Class of Strongly Perfect Graphs | |
Du et al. | Characterizing forbidden pairs for the edge-connectivity of a connected graph to be its minimum degree | |
Wang et al. | An improved diagonal transformation algorithm for the maximum eigenvalue of zero symmetric nonnegative matrices | |
Lin et al. | Oscillation of repeated max-weighted power mean compositions of fuzzy matrices | |
Atanasov et al. | Trees with minimum weighted Szeged index are of a large diameter | |
Aljohani et al. | Edge Odd Graceful Labeling in Some Wheel-Related Graphs | |
Gardner et al. | The Number of Zeros in a Disk of a Complex Polynomial with Coefficients Satisfying Various Monotonicity Conditions |