𝔖 Bobbio Scriptorium
✦   LIBER   ✦

DNA Solution of the Maximal Clique Problem

✍ Scribed by Ouyang, Q.

Book ID
121158529
Publisher
American Association for the Advancement of Science
Year
1997
Tongue
English
Weight
320 KB
Volume
278
Category
Article
ISSN
0036-8075

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the approximability of clique and rel
On the approximability of clique and related maximization problems
✍ Aravind Srinivasan πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 247 KB

We consider approximations of the form n 1Γ€oΓ°1Þ for the Maximum Clique problem, where n is the number of vertices in the input graph and where the ''oΓ°1Þ'' term goes to zero as n increases. We show that sufficiently strong negative results for such problems, which we call strong inapproximability re

Coloring the Maximal Cliques of Graphs
Coloring the Maximal Cliques of Graphs
✍ BacsΓ³, GΓ‘bor; Gravier, Sylvain; GyΓ‘rfΓ‘s, AndrΓ‘s; Preissmann, Myriam; Sebo, AndrΓ‘ πŸ“‚ Article πŸ“… 2004 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 195 KB