Pages that link to "Item:Q2253535"
From MaRDI portal
The following pages link to On clique relaxation models in network analysis (Q2253535):
Displaying 50 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)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- Detecting large risk-averse 2-clubs in graphs with random edge failures (Q513610) (← links)
- A network-based data mining approach to portfolio selection via weighted clique relaxations (Q744697) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
- Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Dense subgraphs in random graphs (Q1741497) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- Multi-attribute community detection in international trade network (Q2129400) (← links)
- Network models to improve robot advisory portfolios (Q2151657) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- A survey of computational methods in protein-protein interaction networks (Q2329889) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Approximating 2-cliques in unit disk graphs (Q2636809) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures (Q3186660) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← 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)
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
