Pages that link to "Item:Q5246711"
From MaRDI portal
The following pages link to Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs (Q5246711):
Displaying 17 items.
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
- On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
