283 citations · 297 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2024★ 1 cited
Ensuring connectedness for the Maximum Quasi-clique and Densest -subgraph problems
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1
Given an undirected graph , a quasi-clique is a subgraph of whose density is at least . Two optimization problems can be defined for quasi-cliques: the Ma…
cs.DM2024★ 2 cited
Solving the Multiobjective Quasi-Clique Problem
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1
Given a simple undirected graph , a quasi-clique is a subgraph of whose density is at least . Finding a maximum quasi-clique has been addressed from two d…