A dynamic programming algorithm for the maximum s-club problem on trees

From MaRDI portal

A dynamic programming algorithm for the maximum \(s\)-club problem on trees

Jump to:navigation, search

DOI10.1016/J.EJOR.2025.08.031MaRDI QIDQ6854708zbMATH OpenFDO

Authors José Alberto Fernández-Zepeda, Alejandro Flores-Lamas, Matthew Hague, Joel Trejo-Sanchez

Publication date 24 February 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programming graph algorithms clique relaxation tree graphs maximum \(s\)-club problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

This page was built for publication: A dynamic programming algorithm for the maximum \(s\)-club problem on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854708)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_dynamic_programming_algorithm_for_the_maximum_%5C(s%5C)-club_problem_on_trees&oldid=75100885"