Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
From MaRDI portal
Publication:360375
DOI10.1007/S10589-013-9548-5zbMATH Open1276.90080OpenAlexW2005863517MaRDI QIDQ360375FDOQ360375
Chitra Balasubramaniam, Sergiy Butenko, B. Balasundaram, Svyatoslav Trukhanov
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 457: finding all cliques of an undirected graph
- Mining market data: a network approach
- The node-deletion problem for hereditary properties is NP-complete
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A fast algorithm for the maximum clique problem
- On clique relaxation models in network analysis
- Clique-detection models in computational biochemistry and genomics
- Novel approaches for analyzing biological networks
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Node-and edge-deletion NP-complete problems
- A graph‐theoretic generalization of the clique concept
- Finding a Maximum Clique in an Arbitrary Graph
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- An algorithm for finding a maximum clique in a graph
- Test case generators and computational results for the maximum clique problem
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Defective coloring revisited
- A new table of constant weight codes
- The Co-2-plex Polytope and Integral Systems
- The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
- The approximation of maximum subgraph problems
- Russian doll search for the Steiner triple covering problem
- Finding maximum cliques in arbitrary and in special graphs
Cited In (25)
- Continuous cubic formulations for cluster detection problems in networks
- An exact algorithm for the maximum probabilistic clique problem
- On risk-averse maximum weighted subgraph problems
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Fast Cluster Detection in Networks by First Order Optimization
- Scale reduction techniques for computing maximum induced bicliques
- The maximum independent union of cliques problem: complexity and exact approaches
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Computing maximum \(k\)-defective cliques in massive graphs
- Minimum cost flow problem with conflicts
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- Asymptotic bounds for clustering problems in random graphs
- On maximum ratio clique relaxations
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- Assignment problem with conflicts
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
- Finding conserved low-diameter subgraphs in social and biological networks
- Maximum weight relaxed cliques and Russian doll search revisited
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
- Multivariate algorithmics for finding cohesive subnetworks
Uses Software
This page was built for publication: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360375)
