Pages that link to "Item:Q3013154"

The following pages link to A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing (Q3013154):

Displayed 20 items.

• Editing graphs into disjoint unions of dense clusters (Q652530) ‎ (← links)
• A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) ‎ (← links)
• Combining clickstream analyses and graph-modeled data clustering for identifying common response processes (Q823870) ‎ (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) ‎ (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) ‎ (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) ‎ (← links)
• A golden ratio parameterized algorithm for cluster editing (Q1932356) ‎ (← links)
• Polyhedral properties of the induced cluster subgraphs (Q2022509) ‎ (← links)
• Optimization problems for the maximum \(k\)-plex (Q2103796) ‎ (← links)
• Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) ‎ (← links)
• Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) ‎ (← links)
• A cubic-vertex kernel for flip consensus tree (Q2441594) ‎ (← links)
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) ‎ (← 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)
• Alternative Parameterizations for Cluster Editing (Q3075528) ‎ (← 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)
• Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) ‎ (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) ‎ (← links)