Parameterized algorithmics and computational experiments for finding 2-clubs

DOI10.7155/JGAA.00352MaRDI QIDQ5246711zbMATH OpenOpenAlexFDO

Authors Sepp Hartung, Christian Komusiewicz, André Nichterlein

Publication date 22 April 2015

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00352

zbMATH Keywords

polynomial-size problem kernels

Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
• On Editing Graphs into 2-Club Clusters
• On 2-clubs in graph-based data clustering: theory and algorithm engineering

Cited in

(24)

• Optimal approximation algorithms for maximum distance-bounded subgraph problems
• On biconnected and fragile subgraphs of low diameter
• Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
• Multivariate algorithmics for finding cohesive subnetworks
• Parameterized computational complexity of finding small-diameter subgraphs
• Hardness and tractability of the \(\gamma\)-complete subgraph problem
• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
• The parameterized complexity of \(s\)-club with triangle and seed constraints
• Subexponential algorithm for d-cluster edge deletion: exception or rule?
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
• On the tractability of finding disjoint clubs in a network
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• On the 2-club polytope of graphs
• Finding Disjoint Dense Clubs in an Undirected Graph
• Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
• Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• Covering a graph with clubs
• On the tractability of covering a graph with 2-clubs
• The parameterized complexity of \(s\)-club with triangle and seed constraints
• Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
• Finding conserved low-diameter subgraphs in social and biological networks
• A dynamic programming algorithm for the maximum s-club problem on trees
• On the hardness of problems around s-clubs on split graphs

Describes a project that uses

Uses Software

• DIMACS

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 Q5246711)