Pages that link to "Item:Q922964"
From MaRDI portal
The following pages link to An exact algorithm for the maximum clique problem (Q922964):
Displaying 50 items.
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Reducing graph coloring to clique search (Q326946) (← links)
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- Permutation codes with specified packing radius (Q356723) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- A new table of permutation codes (Q766240) (← links)
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm (Q1040788) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Detecting embedded Horn structure in propositional logic (Q1198035) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- Improving heuristics for the frequency assignment problem (Q1296060) (← links)
- Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
- A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
- The maximum clique problem (Q1318271) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- Risk transportation via a clique number problem formulation. (Q1412758) (← links)
- The composition of semi-finished inventories at a solid board plant. (Q1428051) (← links)
- Generation of lower bounds for minimum span frequency assignment (Q1602703) (← links)
- A fast algorithm for the maximum clique problem (Q1613374) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
- Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
