4 citations · 16 across the 19 of their papers we have counts for
1 paper · 1 filter
Yair Caro, Josef Lauri, Christina Zarb
Given a graph G, we would like to find (if it exists) the largest induced subgraph H in which there are at least k vertices realizing the maximum degree of H. This problem…