Pages that link to "Item:Q3741641"
From MaRDI portal
The following pages link to Finding a Maximum Clique in an Arbitrary Graph (Q3741641):
Displaying 48 items.
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- Median graphs: A genetic approach based on new theoretical properties (Q2270833) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- A simple simulated annealing algorithm for the maximum clique problem (Q2456476) (← links)
- Genetic algorithmic approach to find the maximum weight independent set of a graph (Q2471331) (← links)
- Clique-detection models in computational biochemistry and genomics (Q2491763) (← links)
- Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
- (Q3024804) (← links)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- On the lcm of the Differences of Eight Primes (Q3809853) (← links)
- A global optimization approach for solving the maximum clique problem (Q4009762) (← links)
- (Q4250228) (← links)
- Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem (Q4285462) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- (Q4501558) (← links)
- Computing and Combinatorics (Q4681173) (← links)
- (Q4705344) (← links)
- Using Fifth Generation Tools for Solving the Clique Number Problem (Q4712613) (← links)
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning (Q4816960) (← links)
- Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- An analysis of parameter adaptation in reactive tabu search (Q4979993) (← links)
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
- (Q5874486) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5905591) (← links)
- A generalization of maximal independent sets (Q5931790) (← links)
- A set packing model for the ground holding problem in congested networks (Q5935422) (← links)
- A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
- Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)