Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
From MaRDI portal
Publication:5246711
DOI10.7155/jgaa.00352zbMath1310.05076OpenAlexW2061931042MaRDI QIDQ5246711
Christian Komusiewicz, André Nichterlein, Sepp Hartung
Publication date: 22 April 2015
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00352
Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (17)
Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies ⋮ Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering ⋮ Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? ⋮ On the tractability of finding disjoint clubs in a network ⋮ On the 2-Club Polytope of Graphs ⋮ On biconnected and fragile subgraphs of low diameter ⋮ On 2-clubs in graph-based data clustering: theory and algorithm engineering ⋮ Covering a Graph with Clubs ⋮ Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ On the tractability of covering a graph with 2-clubs
Uses Software
This page was built for publication: Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
