Pages that link to "Item:Q360375"
From MaRDI portal
The following pages link to Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375):
Displaying 30 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- A network-based data mining approach to portfolio selection via weighted clique relaxations (Q744697) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← 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)
- Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- The maximum clique problem for permutation Hamming graphs (Q2156387) (← 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)
- Assignment problem with conflicts (Q2273673) (← links)
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- Faster recognition of clique-Helly and hereditary clique-Helly graphs (Q2379939) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem (Q3013924) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (Q3590946) (← links)
- Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
