Markdown informations

AUTHORS.md

+# Authors
+
+1. François Pitois, IdHAL: francois-pitois. Affiliation : 1,2
+
+# Affiliations
+
+1. LIRIS, Villeurbanne, France (UMR 5205)
+2. LIB, Dijon, France (EA 7534)

LICENCE.md

+This code is under CC BY-NC 4.0
+
+Graphs provided in the directory `graph_batch` are taken from the following databases:
+- Leskovec J. and Krevl A.: *SNAP Datasets: Stanford Large Network Dataset Collection* (2014), http://snap.stanford.edu/data
+- Rossi, R.A. and Ahmed, N.K.: *The network data repository with interactive graph analytics and visualization*. In: Proceedings of the TwentyNinth AAAI Conference on Artificial Intelligence (2015). http://networkrepository.com
+- Rozemberczki, B., Allen, C. and Sarkar, R.: *Multi-scale Attributed Node Embedding* (2019)

README.md

 # Fine-Grained Structural Partitioning
 
+This is an algorithm for graph partitionning.
+Run `run.sh path_to_graph`, where graph is a file containing one edge per line.
+An edge should be written as `a,b,w`, where `a`, `b` and `w` are three integers :
+- `a` is the ID of the first vertex,
+- `b` is the ID of the second vertex,
+- `w` is the weight of the edge.
+Weights are ignored in this algorithm, but should be there for compatibily reasons.