Pages that link to "Item:Q2897998"
From MaRDI portal
The following pages link to On Editing Graphs into 2-Club Clusters (Q2897998):
Displaying 20 items.
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Cluster graph modification problems (Q1885821) (← links)
- Even better fixed-parameter algorithms for bicluster editing (Q2019506) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (Q3638452) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion (Q6038703) (← links)
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)
- Improved kernelization and fixed-parameter algorithms for bicluster editing (Q6645187) (← links)
