Node Overlap Removal for 1D Graph Layout: Proof of Theorem 1

Samiha Fadloun (1) , Pascal Poncelet (1) , Julien Rabatel (1) , Mathieu Roche (2) , Arnaud Sallaberry (1)

1 ADVANSE - ADVanced Analytics for data SciencE
2 UMR TETIS - Territoires, Environnement, Télédétection et Information Spatiale

In this report, we give the complete proof of the theorem 1 of the paper "Node Overlap Removal for 1D Graph Layout (IV'17)". This theorem states that the method described in the paper meets 4 requirements. The proof is given for each of these requirements.

Domaines: Informatique [cs]

Samiha Fadloun, Pascal Poncelet, Julien Rabatel, Mathieu Roche, Arnaud Sallaberry. Node Overlap Removal for 1D Graph Layout: Proof of Theorem 1. [Research Report] LIRMM (UM, CNRS). 2017. ⟨lirmm-01521385v1⟩