Proportionally dense subgraph of maximum size: Complexity and approximation - LAMSADE (Laboratoire d'Analyse et de Modélisation des Systèmes pour l'Aide à la Décision) Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2019

Proportionally dense subgraph of maximum size: Complexity and approximation

Résumé

We define a proportionally dense subgraph (PDS) as an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the graph. We prove that the problem of finding a PDS of maximum size is APX-hard on split graphs, and NP-hard on bipartite graphs.

Dates et versions

hal-02408761 , version 1 (13-12-2019)

Identifiants

Citer

Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau. Proportionally dense subgraph of maximum size: Complexity and approximation. Discrete Applied Mathematics, 2019, 270, ⟨10.1016/j.dam.2019.07.010⟩. ⟨hal-02408761⟩
21 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More