Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs

DOI10.1007/978-3-642-33293-7_22MaRDI QIDQ4899256zbMATH OpenOpenAlexFDO

Authors Sepp Hartung, Christian Komusiewicz, André Nichterlein

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

Graph algorithms (graph-theoretic aspects) (05C85) 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)

Recommendations

• Parameterized algorithmics and computational experiments for finding 2-clubs
• Upper bounds and heuristics for the 2-club problem
• Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
• Two-phase heuristics for the \(k\)-club problem
• Algorithms for the maximum k-club problem in graphs
• On the tractability of covering a graph with 2-clubs
• On the tractability of covering a graph with 2-clubs
• Covering with clubs: complexity and approximability

Cited in

(13)

• Finding clubs in graph classes
• An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
• Parameterized computational complexity of finding small-diameter subgraphs
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• Distance-based clique relaxations in networks: s-clique and s-club
• Parameterized algorithmics and computational experiments for finding 2-clubs
• Finding disjoint dense clubs in a social network
• Finding Disjoint Dense Clubs in an Undirected Graph
• Finding large k-clubs in undirected graphs
• Graph motif problems parameterized by dual
• The parameterized complexity of \(s\)-club with triangle and seed constraints
• Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
• Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments

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

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