Node Overlap Removal for 1D Graph Layout: Proof of Theorem 1
Résumé
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]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...