Pages that link to "Item:Q1759884"

The following pages link to On the maximum quasi-clique problem (Q1759884):

Displaying 43 items.

• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
• Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
• A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
• 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)
• The maximum clique interdiction problem (Q1735171) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
• Dense subgraphs in random graphs (Q1741497) (← links)
• On the query complexity of clique size and maximum satisfiability (Q1816736) (← links)
• The complete list of maximal cliques of Quad\((n,q)\), \(q\) odd (Q1891361) (← links)
• Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
• On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
• Optimization problems for the maximum \(k\)-plex (Q2103796) (← 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)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• The maximum ratio clique problem (Q2356159) (← links)
• The triangle \(k\)-club problem (Q2359790) (← links)
• Near optimal solutions for maximum quasi-bicliques (Q2377385) (← links)
• Computational study of the US stock market evolution: a rank correlation-based network model (Q2438061) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Approximating 2-cliques in unit disk graphs (Q2636809) (← links)
• LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← 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)
• On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (Q4565788) (← links)
• A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
• Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
• Finding groups with maximum betweenness centrality (Q5268927) (← links)
• On atomic cliques in temporal graphs (Q6043101) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• On maximum ratio clique relaxations (Q6085884) (← 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)
• On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
• \( \gamma \)-clustering problems: classical and parametrized complexity (Q6615214) (← links)
• On finding the community with maximum persistence probability (Q6655141) (← links)