Pages that link to "Item:Q1928521"

The following pages link to Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521):

Displaying 19 items.

• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
• Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
• A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← links)
• Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
• On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
• A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
• Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
• (Q5225203) (← links)
• Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
• Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)