Skip to content

DiscretePath

Understanding networks

Menu
  • Home
  • Features
  • Screenshots
  • Software
  • User manuals
  • Beyond DP
  • Resources
  • Contact
  • Version history
  • Privacy Policy

Resources

Graph examples

Arabidopsis complex
An example graph assigning categories to vertices
Categories
Example of a network drawn by DiscretePath
Facebook
Example of a network drawn by DiscretePath
Les Miserables
An example of a radial tree drawn by DiscretePath
A radial tree
Example of a network drawn by DiscretePathath
Senate US
Icon

Graph examples

1 file(s) 197.3
Download

Utilities and references

Utilities

Icon

Data formats for import: example spreadsheets

1 file(s) 68 KB
Download
Icon

Road map of Romania.xlsx

1 file(s) 9.9 KB
Download

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
Icon

Random Walks: Basic Concepts and Applications

1 file(s) 707.56 KB
Download
Icon

Random Walks on Graphs

1 file(s) 2.52 MB
Download
  • Decision trees
Icon

Decision Trees (Petr Pošík)

1 file(s) 713.01 KB
Download
Icon

Classification: Decision Trees

1 file(s) 3.03 MB
Download
Icon

Decision trees: data sets

1 file(s) 159 KB
Download
Icon

A simple guide to entropy-based discretization_Meurer

1 file(s) 234 KB
Download
  • Barycenter layout
Icon

Matrix Reordering Methods for Table and Network Visualization

1 file(s) 2.34 MB
Download
Icon

The Barycenter Heuristic and the Reorderable Matrix

1 file(s) 208.39 KB
Download
Icon

Simple Algorithms for Network Visualization: A Tutorial

1 file(s) 2.65 MB
Download

Go to the Welcome page

The user manual can be downloaded: User manuals

DiscretePath 2025 . Powered by WordPress