scientific article; zbMATH DE number 1424314
From MaRDI portal
Publication:4945528
Recommendations
Cited in
(69)- An effective local search for the maximum clique problem
- Algorithmic problems in right-angled Artin groups: complexity and applications
- Exact algorithms for the minimum cost vertex blocker clique problem
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Detecting robust cliques in graphs subject to uncertain edge failures
- A variable neighborhood search heuristic for the maximum ratio clique problem
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Maximum weight relaxed cliques and Russian doll search revisited
- Dense subgraphs in random graphs
- On the query complexity of clique size and maximum satisfiability
- On the approximability of clique and related maximization problems
- Potential energy principles in networked systems and their connections to optimization problems on graphs
- Tackling the maximum happy vertices problem in large networks
- Computing maximum \(k\)-defective cliques in massive graphs
- On the maxima of Motzkin-Straus programs and cliques of graphs
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Parsimonious formulations for low-diameter clusters
- Graph signatures: identification and optimization
- Large-scale clique cover of real-world networks
- On the maximum small-world subgraph problem
- An integer programming approach for finding the most and the least central cliques
- The maximum clique problem in multiple interval graphs
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
- Using critical sets to solve the maximum independent set problem
- A hybrid heuristic for the maximum clique problem
- A study of ACO capabilities for solving the maximum clique problem
- Clique-detection models in computational biochemistry and genomics
- Mining market data: a network approach
- Scale reduction techniques for computing maximum induced bicliques
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Finding top-N colossal patterns based on clique search with dynamic update of graph
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- Finding maximum subgraphs with relatively large vertex connectivity
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- scientific article; zbMATH DE number 5997363 (Why is no real title available?)
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- On CLIQUE Problem for Sparse Graphs of Large Dimension
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- On graphs with polynomially solvable maximum-weight clique problem
- Finding clubs in graph classes
- Distributed algorithms for maximum cliques
- On inclusionwise maximal and maximum cardinality k-clubs in graphs
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Sequences with good correlation property based on depth and interleaving techniques
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Constraint and satisfiability reasoning for graph coloring
- Why is maximum clique often easy in practice?
- Finding quasi core with simulated stacked neural networks
- scientific article; zbMATH DE number 956841 (Why is no real title available?)
- scientific article; zbMATH DE number 956847 (Why is no real title available?)
- Hard graphs for the maximum clique problem
- A polyhedral study of the maximum edge subgraph problem
- Adaptive, restart, randomized greedy heuristics for maximum clique
- Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches
- An exact algorithm for the maximum quasi‐clique problem
- A study of an undirected graph on a finite subset of natural numbers
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
- Asymptotic bounds for clustering problems in random graphs
- Finding conserved low-diameter subgraphs in social and biological networks
- Rank-sparsity decomposition for planted quasi clique recovery
- Two-phase GRASP for the multi-constraint graph partitioning problem
- Solving the multiobjective quasi-clique problem
- Ensuring connectedness for the maximum quasi-clique and densest k-subgraph problems
- A branch-and-bound approach for maximum quasi-cliques
- Minimum cost edge blocker clique problem
- Why organizational networks in reality do not show scale-free distributions
- Statistical analysis of financial networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945528)
