On clique relaxation models in network analysis
From MaRDI portal
Publication:2253535
DOI10.1016/j.ejor.2012.10.021zbMath1292.05208OpenAlexW1980096229MaRDI QIDQ2253535
Sergiy I. Butenko, Jeffrey Pattillo, Nataly Youssef
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.10.021
maximum clique problembiological networkssocial network analysisclique relaxationscohesive subgroups
Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Systems biology, networks (92C42)
Related Items (59)
The triangle \(k\)-club problem ⋮ Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Multi-attribute community detection in international trade network ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ Scale reduction techniques for computing maximum induced bicliques ⋮ Detecting robust cliques in graphs subject to uncertain edge failures ⋮ Approximating 2-cliques in unit disk graphs ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Network models to improve robot advisory portfolios ⋮ Fast Cluster Detection in Networks by First Order Optimization ⋮ The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures ⋮ Frequency-driven tabu search for the maximum \(s\)-plex problem ⋮ Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques ⋮ LP-based dual bounds for the maximum quasi-clique problem ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ Maximum weight relaxed cliques and Russian doll search revisited ⋮ On atomic cliques in temporal graphs ⋮ On maximum ratio clique relaxations ⋮ Minimum k‐cores and the k‐core polytope ⋮ On the 2-Club Polytope of Graphs ⋮ The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study ⋮ On biconnected and fragile subgraphs of low diameter ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments ⋮ Parsimonious formulations for low-diameter clusters ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ The maximum clique interdiction problem ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ Dense subgraphs in random graphs ⋮ An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ Graph signatures: identification and optimization ⋮ On robust clusters of minimum cardinality in networks ⋮ Detecting large risk-averse 2-clubs in graphs with random edge failures ⋮ A branch-and-price-and-cut method for computing an optimal bramble ⋮ On exact solution approaches for the longest induced path problem ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Computing maximum \(k\)-defective cliques in massive graphs ⋮ A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems ⋮ Dual Inequalities for Stabilized Column Generation Revisited ⋮ A network-based data mining approach to portfolio selection via weighted clique relaxations ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters ⋮ On the maximum small-world subgraph problem ⋮ A survey of computational methods in protein-protein interaction networks ⋮ Exact algorithms for the minimum \(s\)-club partitioning problem ⋮ Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs ⋮ Worst-case analysis of clique MIPs ⋮ Continuous cubic formulations for cluster detection problems in networks ⋮ An integer programming approach for finding the most and the least central cliques ⋮ New analytical lower bounds on the clique number of a graph ⋮ Finding groups with maximum betweenness centrality ⋮ On connected dominating sets of restricted diameter
This page was built for publication: On clique relaxation models in network analysis
