Name
Title | ||
|---|---|---|
Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets. |
Abstract | ||
|---|---|---|
The problem of counting the number of independent sets of a graph G (denoted as i(G)) is a classic #P-complete problem. We present some patterns on graphs that allows us the polynomial computation of i(G). |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-49076-8_6 | MCPR |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillermo De Ita Luna | 1 | 29 | 16.57 |
| Miguel Rodríguez | 2 | 0 | 0.34 |
| Pedro Bello | 3 | 0 | 2.37 |
| Meliza Contreras | 4 | 0 | 0.34 |