Node Overlap Removal for 1D Graph Layout: Proof of Theorem 1 - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports (Research Report) Year : 2017

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

Abstract

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.
Fichier principal
Vignette du fichier
fadloun_al_2017b.pdf (173.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01521385 , version 1 (11-05-2017)
lirmm-01521385 , version 2 (17-11-2017)

Identifiers

  • HAL Id : lirmm-01521385 , version 2

Cite

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-01521385v2⟩
318 View
321 Download

Share

Gmail Facebook X LinkedIn More