Pages that link to "Item:Q434188"

The following pages link to Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188):

Displaying 16 items.

• Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• Co-2-plex vertex partitions (Q498448) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• Optimization problems for the maximum \(k\)-plex (Q2103796) (← links)
• Discovering subjectively interesting multigraph patterns (Q2203340) (← links)
• Finding lasting dense subgraphs (Q2218373) (← links)
• On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
• A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
• Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)