Jump to content

Draft:MaxCliqueDyn algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by AminoKislina (talk | contribs) at 08:00, 30 August 2016 (MaxCliqueDyn algorithm is an algorithm for finding a maximum clique in an undirected graph.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


Orange
Developer(s)University of Ljubljana
Stable release
3.3
Written inPython, Cython, C++, C
Operating systemCross-platform
TypeMachine learning, Data mining, Data visualization, Data analysis
LicenseGNU General Public License
Websiteorange.biolab.si


References

Retrieved from "https://en.wikipedia.org/w/index.php?title=Draft:MaxCliqueDyn_algorithm&oldid=736852601"