To accomplish this, they solve the "densest subgraph problem" on specifically created "bipartite" graphs centered at "hops" by transforming the problem into an equivalent "minimum set cover" framework.
these boldfaced words often occur as hop-based school-ofthought words.