Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets
Sign Up to like & getrecommendations! Published in 2020 at "Pattern Recognition"
DOI: 10.1007/978-3-030-49076-8_6
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).… read more here.
Keywords: graphs; computation; pattern; number independent ... See more keywords