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.

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
fadloun_al_2017b.pdf (173.88 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Arnaud Sallaberry  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01521385

Submitted on : Friday, November 17, 2017-4:37:04 PM

Last modification on : Wednesday, January 8, 2025-3:28:03 PM

Long-term archiving on : Sunday, February 18, 2018-5:09:05 PM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CIRAD AGROPARISTECH CNRS UNIV-MONTP3 IRSTEA ADVANSE LIRMM AGROPOLIS TETIS LARA MIPS UNIV-MONTPELLIER INRAE INRAEOCCITANIEMONTPELLIER MATHNUM AMIS
344 View
348 Download

Share

More