Pages that link to "Item:Q1267190"
From MaRDI portal
The following pages link to An algorithm for finding a maximum clique in a graph (Q1267190):
Displaying 39 items.
- Reducing graph coloring to clique search (Q326946) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- A decomposition approach for commodity pickup and delivery with time-windows under uncertainty (Q490359) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- Finding quasi core with simulated stacked neural networks (Q526647) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- An algorithm for reporting maximal \(c\)-cliques (Q817824) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- Refined pivot selection for maximal clique enumeration in graphs (Q899307) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- HEWN: A polynomial algorithm for CLIQUE problem (Q1288412) (← links)
- The maximum clique problem (Q1318271) (← links)
- A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
- Three approximation algorithms for solving the generalized segregated storage problem. (Q1426687) (← links)
- A fast algorithm for the maximum clique problem (Q1613374) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
- An independent set approach for the communication network of the GPS III system (Q1941383) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- A constraint programming approach to extract the maximum number of non-overlapping test forms (Q2506175) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- A scatter search algorithm for the maximum clique problem (Q2776559) (← links)
- On planar medianoid competitive location problems with Manhattan distance (Q2836517) (← links)
- An improved branch and bound algorithm for the maximum clique problem (Q2837833) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- Finding a Maximum Clique in an Arbitrary Graph (Q3741641) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897220) (← links)
