Pages that link to "Item:Q276864"

The following pages link to Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864):

Displaying 20 items.

• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
• A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• Dense subgraphs in random graphs (Q1741497) (← links)
• On exact solution approaches for the longest induced path problem (Q1999389) (← links)
• An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
• The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
• On the maximum small-world subgraph problem (Q2327623) (← links)
• Online summarization of dynamic graphs using subjective interestingness for sequential data (Q2659275) (← links)
• LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
• Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques (Q3294898) (← links)
• An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
• A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
• On atomic cliques in temporal graphs (Q6043101) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• An exact algorithm for the maximum quasi‐clique problem (Q6088204) (← links)
• The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
• Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)