1 citations · 2 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 1 cited
Counting Homomorphic Cycles in Degenerate Graphs
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira +1
Since counting subgraphs in general graphs is, by and large, a computationally demanding problem, it is natural to try and design fast algorithms for restricted families of graphs.…
cs.CC2020★ 1 cited
Counting Subgraphs in Degenerate Graphs
Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov +2
We consider the problem of counting the number of copies of a fixed graph within an input graph . This is one of the most well-studied algorithmic graph problems, with many…