Pages that link to "Item:Q1267190"

The following pages link to An algorithm for finding a maximum clique in a graph (Q1267190):

Displaying 24 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 efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← 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)
• Three approximation algorithms for solving the generalized segregated storage problem. (Q1426687) (← links)
• A fast algorithm for the maximum clique problem (Q1613374) (← 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)
• 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)
• ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE (Q2836517) (← links)