Pages that link to "Item:Q1686057"

The following pages link to Maximum weight relaxed cliques and Russian doll search revisited (Q1686057):

Displaying 7 items.

• Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
• An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
• A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
• Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
• A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)