Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
From MaRDI portal
Publication:360375
DOI10.1007/s10589-013-9548-5zbMath1276.90080OpenAlexW2005863517MaRDI QIDQ360375
Chitra Balasubramaniam, Balabhaskar Balasundaram, Svyatoslav Trukhanov, Sergiy I. Butenko
Publication date: 26 August 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9548-5
Related Items (22)
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Scale reduction techniques for computing maximum induced bicliques ⋮ Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ Fast Cluster Detection in Networks by First Order Optimization ⋮ Frequency-driven tabu search for the maximum \(s\)-plex problem ⋮ A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques ⋮ The maximum independent union of cliques problem: complexity and exact approaches ⋮ Maximum weight relaxed cliques and Russian doll search revisited ⋮ Minimum cost flow problem with conflicts ⋮ An exact algorithm for the maximum probabilistic clique problem ⋮ On risk-averse maximum weighted subgraph problems ⋮ On maximum ratio clique relaxations ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem ⋮ Assignment problem with conflicts ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ Computing maximum \(k\)-defective cliques in massive graphs ⋮ A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems ⋮ 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 ⋮ Continuous cubic formulations for cluster detection problems in networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Russian doll search for the Steiner triple covering problem
- Finding maximum cliques in arbitrary and in special graphs
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- The node-deletion problem for hereditary properties is NP-complete
- An algorithm for finding a maximum clique in a graph
- Test case generators and computational results for the maximum clique problem
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A fast algorithm for the maximum clique problem
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- On clique relaxation models in network analysis
- Clique-detection models in computational biochemistry and genomics
- Mining market data: a network approach
- Novel approaches for analyzing biological networks
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Defective coloring revisited
- A new table of constant weight codes
- The Co-2-plex Polytope and Integral Systems
- Finding a Maximum Clique in an Arbitrary Graph
- The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
- A graph‐theoretic generalization of the clique concept
- The approximation of maximum subgraph problems
- Node-and edge-deletion NP-complete problems
- Algorithm 457: finding all cliques of an undirected graph
This page was built for publication: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
