23 citations · 54 across the 45 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
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…
cs.CC2012
A Note on the Balanced ST-Connectivity
Shiva Kintali, Asaf Shapira
We prove that every YES instance of Balanced ST-Connectivity has a balanced path of polynomial length.