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.
Document type :
Reports
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01521385
Contributor : Arnaud Sallaberry <>
Submitted on : Friday, November 17, 2017 - 4:37:04 PM
Last modification on : Wednesday, September 18, 2019 - 4:04:05 PM
Long-term archiving on : Sunday, February 18, 2018 - 5:09:05 PM

File

fadloun_al_2017b.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-01521385, version 2

Citation

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⟩

Share

Metrics

Record views

273

Files downloads

352