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
On the Interplay between Software Product Lines an
Raisonnement automatique
Tuesday 18 October 2022 - 14h15
Salle : 2013 - DIG-Moulon
Vander Alves .............................................

Combining randomized and observational data: Towar
Raisonnement automatique
Thursday 13 October 2022 - 10h30
Salle : 2011 - DIG-Moulon
Bénédicte Colnet .............................................

New Achievements of Artificial Intelligence in Mul
Raisonnement automatique
Tuesday 11 October 2022 - 14h15
Salle : 2013 - DIG-Moulon
.............................................

Definition and estimation of a variable importance
Raisonnement automatique
Thursday 22 September 2022 - 10h30
Salle : 2011 - DIG-Moulon
.............................................

Definition and estimation of a variable importance
Raisonnement automatique
Thursday 01 September 2022 - 10h30
Salle : 2011 - DIG-Moulon
Antoine Chambaz .............................................