Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
From MaRDI portal
(Redirected from Publication:360375)
Recommendations
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Computing maximum \(k\)-defective cliques in massive graphs
- Algorithms for the maximum k-club problem in graphs
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
Cites work
- scientific article; zbMATH DE number 434893 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- scientific article; zbMATH DE number 939919 (Why is no real title available?)
- scientific article; zbMATH DE number 1867238 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- A fast algorithm for the maximum clique problem
- A graph‐theoretic generalization of the clique concept
- A new table of constant weight codes
- Algorithm 457: finding all cliques of an undirected graph
- An algorithm for finding a maximum clique in a graph
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Clique-detection models in computational biochemistry and genomics
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Defective coloring revisited
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Finding a Maximum Clique in an Arbitrary Graph
- Finding maximum cliques in arbitrary and in special graphs
- Mining market data: a network approach
- Node-and edge-deletion NP-complete problems
- Novel approaches for analyzing biological networks
- On clique relaxation models in network analysis
- Russian doll search for the Steiner triple covering problem
- Test case generators and computational results for the maximum clique problem
- 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
- The node-deletion problem for hereditary properties is NP-complete
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
Cited in
(31)- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Minimum cost flow problem with conflicts
- Finding conserved low-diameter subgraphs in social and biological networks
- Maximum weight relaxed cliques and Russian doll search revisited
- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
- Computing maximum \(k\)-defective cliques in massive graphs
- An exact algorithm for the maximum probabilistic clique problem
- On risk-averse maximum weighted subgraph problems
- Assessing the computational complexity of multi-layer subgraph detection
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- On maximum ratio clique relaxations
- The maximum clique problem for permutation Hamming graphs
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Assignment problem with conflicts
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Scale reduction techniques for computing maximum induced bicliques
- Asymptotic bounds for clustering problems in random graphs
- Multivariate algorithmics for finding cohesive subnetworks
- The maximum independent union of cliques problem: complexity and exact approaches
- Continuous cubic formulations for cluster detection problems in networks
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- Fast cluster detection in networks by first order optimization
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)
