Back to Results
First PageMeta Content
Graph operations / Graph coloring / Clique problem / Clique / Independent set / Neighbourhood / Degree / Path decomposition / Maximal independent set / Graph theory / Theoretical computer science / NP-complete problems


A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org
Add to Reading List

Document Date: 2009-02-11 00:35:51

Open Document

File Size: 133,15 KB

Share Result on Facebook

City

Providence / /

Company

Freeman & Co. / /

/

IndustryTerm

recent continuous algorithms / polynomial time algorithm / /

Person

Stanislav Busygin / /

ProvinceOrState

Rhode Island / /

Technology

polynomial time algorithm / SM algorithms / two recent continuous algorithms / /

URL

http /

SocialTag