A Julia package for simulations on random trees.
-
Updated
Apr 6, 2020 - Jupyter Notebook
A Julia package for simulations on random trees.
K-degree Graph anonymization for Data protection and privacy of individual social network data.
DFS, BFS and Haval-hakimi : implementation with Java (Graphic)
A simple algorithm written in Python to determine if a given degree sequence is graphical.
Semiannual project of the subject of Graph Theory, taught at Centro Universitário FEI. It consists of reading a file that contains a matrix, which represents a graph. From its reading, certain information about the graph is displayed.
Add a description, image, and links to the degree-sequence topic page so that developers can more easily learn about it.
To associate your repository with the degree-sequence topic, visit your repo's landing page and select "manage topics."