Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Labeling schemes for bounded degree graphs
Noy Rotbart

20 September 2013, 14h00 - 20 September 2013, 15h00
Salle/Bat : 455/PCRI-N
Contact : noyro@diku.dk

Activités de recherche :

Résumé :
Labeling schemes, a subject closely related to induced and induced universal graphs, have been studied extensively in the theoretical computer science community over the last 2 decades.
In my talk I will introduce the concept and present new results for graphs of bounded degree ∆. In particular I will present the following results:

1. An optimal log n + O( log ∆) adjacency labeling scheme for bounded degree trees.

2. An optimal (⌊∆⌋/2+1)logn adjacency labeling scheme for general bounded degree graphs.

3. An improved adjacency labeling scheme for general graphs with bounded degree √(n) < ∆ ≤ n/5 (using combinatorial number system).

The talk will conclude with a survey of open problems in the field.

Pour en savoir plus :
Séminaires
Recent advances in high-performance computing
Calcul à haute performance
Friday 29 September 2017 - 09h30
Salle : 465 - PCRI-N
Jose Roman, Lokmane Abbas Turki, Camille Coti .............................................

Modélisation énergétique qualitative de l'organism
Biologie des systèmes
Thursday 21 September 2017 - 14h30
Salle : 465 - PCRI-N
Marc Irigoin-Guichandut .............................................

Involution Delay Model: Faithful Delay Prediction
Tuesday 25 July 2017 - 14h00
Salle : 465 - PCRI-N
Jürgen Maier .............................................

Building Distributed Computing Abstractions in the
Algorithmique distribuée
Tuesday 11 July 2017 - 10h30
Salle : 465 - PCRI-N
Antonella Del Pozzo .............................................

Slow Molecule Revolution
Algorithmique distribuée
Wednesday 05 July 2017 - 10h30
Salle : 465 - PCRI-N
David Doty .............................................