Graph examples

Utilities and references

Utilities

References

• Tomita, E.; and Kameda, T. (2007) An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J Glob Optim, 37, 95–111. DOI 10.1007/s10898-006-9039-7
• Roughgarden, T. Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures. Publishing, LLC (2018) ISBN: 978-0999282922
• Srivastava, A., Pillai, A., Gupta, D.J. (2018) Maximum Clique Finder: MCF. ITEE Journal, 7(3), 28-33
• Mitina, A. Applied Combinatorics: with Graph Theory. (2019) ISBN: 978-1709599644
• Huang, G., Li, Y., Tan, X., Tan, Y., Lu, X. (2020) PLANET: A radial layout algorithm for network visualization. Physica A 539, 122948. DOI 10.1016/j.physa.2019.122948
• Menczer, F., Fortunato, S. and Davis, C.A. A First Course in Network Science. Cambridge University Press (2020) ISBN: 1108471137
• Krzywinski, M., Altman, N. (2017) Classification and regression trees. Nature Methods, 14(8), 757-758
• Dougherty, J., Kohavi, R., Sahami, M. Supervised and Unsupervised Discretization of Continuous Features. In Armand Prieditis and Stuart Russell eds., Machine Learning: Proceedings of the Twelfth International Conference, 1995, Morgan Kaufmann Publishers, San Francisco, C.A.
• Meurer, N. (2015) A Simple Guide to Entropy-Based Discretization.

• Random walks

• Decision trees

• Barycenter layout

Go to the Welcome page

The user manual can be downloaded: User manuals