Pages that link to "Item:Q807639"
From MaRDI portal
The following pages link to Finding maximum cliques in arbitrary and in special graphs (Q807639):
Displayed 17 items.
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← 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)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- A network-flow-based lower bound for the minimum weighted integer coloring problem (Q1589479) (← links)
- A fast algorithm for the maximum clique problem (Q1613374) (← links)
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- Clique-detection models in computational biochemistry and genomics (Q2491763) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)