Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs

DOI10.1007/978-3-642-33293-7_22zbMath1375.68065OpenAlexW56839923MaRDI QIDQ4899256

André Nichterlein, Christian Komusiewicz, Sepp Hartung

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Finding disjoint dense clubs in a social network ⋮ Finding clubs in graph classes ⋮ Graph Motif Problems Parameterized by Dual ⋮ Finding Disjoint Dense Clubs in an Undirected Graph ⋮ Finding large \(k\)-clubs in undirected graphs ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club ⋮ On structural parameterizations for the 2-club problem

This page was built for publication: Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs