Login / Signup

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

Daniela Scherer dos SantosKathrin KlamrothPedro MartinsLuís Paquete
Published in: CoRR (2024)
Keyphrases
  • machine learning
  • benchmark problems
  • problems involving
  • data sets
  • social networks
  • decision trees
  • np hard
  • decision problems
  • solving problems