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

Samiha Fadloun; Pascal Poncelet; Julien Rabatel; Mathieu Roche; Arnaud Sallaberry

Back

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

Report

Open access

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

Samiha Fadloun, Pascal Poncelet, Julien Rabatel, Mathieu Roche and Arnaud Sallaberry

11/05/2017

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.

Files and links (1)

url

Find in HALView

Metrics

1 Record Views

Details

Title: Node Overlap Removal for 1D Graph Layout: Proof of Theorem 1
Creators - without role: Samiha Fadloun - ADVanced Analytics for data SciencE
Pascal Poncelet - ADVanced Analytics for data SciencE
Julien Rabatel - ADVanced Analytics for data SciencE
Mathieu Roche - Territoires, Environnement, Télédétection et Information Spatiale
Arnaud Sallaberry - Université Paul-Valéry Montpellier
Identifiers: 9941250609311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Report
Local Fields: lirmm-01521385