Finding large \(k\)-clubs in undirected graphs

DOI10.1007/s00607-012-0263-3zbMath1310.05195MaRDI QIDQ488393

Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su

Publication date: 26 January 2015

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-012-0263-3

zbMATH Keywords

branch and bound; \(k\)-club; \(k\)-neighbourhood

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

90B10: Deterministic network models in operations research

05C85: Graph algorithms (graph-theoretic aspects)

Uses Software

• DIMACS