1 citations · 1 across the 8 of their papers we have counts for
1 paper · 2 filters
George Manoussakis
A graph is k-degenerate if any induced subgraph has a vertex of degree at most k. In this paper we prove new algorithms for cliques and similar structures for these graphs. We…