K. Klamroth

activity

20232026

most citedEnsuring connectedness for the Maximum Quasi-clique and Densest

k

-subgraph problems

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2024★ 1 cited

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$ -subgraph problems

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1

Given an undirected graph $G$ , a quasi-clique is a subgraph of $G$ whose density is at least $γ$ $(0 < γ \leq 1)$ . Two optimization problems can be defined for quasi-cliques: the Ma…

cs.DM2024

Solving the Multiobjective Quasi-Clique Problem

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1

Given a simple undirected graph $G$ , a quasi-clique is a subgraph of $G$ whose density is at least $γ$ $(0 < γ \leq 1)$ . Finding a maximum quasi-clique has been addressed from two d…

Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems

Solving the Multiobjective Quasi-Clique Problem

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$ -subgraph problems