On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs

Acta Informatica 2026 Open access

Read full text

Authors: Shih-Chia Chang, Li-Hsuan Chen, Sun‐Yuan Hsieh, Ling-Ju Hung, Shih-Shun Kao, Ralf Klasing

DOI: 10.1007/s00236-025-00518-7

Cited by: 0

References: 38

Fields of Study & Subjects

Complexity and Algorithms in Graphs Advanced Graph Theory Research Limits and Structures in Graph Theory

References 38