Pages that link to "Item:Q2341718"
From MaRDI portal
The following pages link to On structural parameterizations for the 2-club problem (Q2341718):
Displayed 15 items.
- Finding clubs in graph classes (Q400518) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← 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)
- Even better fixed-parameter algorithms for bicluster editing (Q2019506) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← 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)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- (Q2927649) (redirect page) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)