Pages that link to "Item:Q1913697"

The following pages link to Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697):

Displaying 19 items.

• Reducing graph coloring to clique search (Q326946) (← links)
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
• Co-2-plex vertex partitions (Q498448) (← links)
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
• An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
• The maximum clique problem (Q1318271) (← links)
• A fast algorithm for the maximum clique problem (Q1613374) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• Efficient pattern matching on big uncertain graphs (Q1671698) (← links)
• On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
• Solving hard set covering problems (Q1924619) (← 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)
• Solving the minimum-weighted coloring problem (Q2748384) (← links)
• Iterative coloring extension of a maximum clique (Q4544221) (← links)
• (Q5155414) (← links)
• Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)