Nalaganje...
Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets
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). For example, we show that for a graph G where its set of cycles can be arranged as embedded cy...
Shranjeno v:
| izdano v: | Pattern Recognition |
|---|---|
| Main Authors: | , , , |
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
2020
|
| Teme: | |
| Online dostop: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7297590/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-49076-8_6 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|