• Aucun résultat trouvé

TD ALGORES

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "TD ALGORES"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Exercise 1 : Centralized MIS-DS-Matching

1. Recall the definition of a MIS, a DS and a (Maximal) Matching.

1. Recall the centralized implementations of MIS, DS and Maximal Matching and discuss their complexity.

Exercise 2 : Distributed MIS-DS-Matching

1. Recall the distrbuted implementation of MIS seen in class. Compute its complexity (time + messages). Is this algorithm working for ring topologies ?

2. Propose a distributed MIS algorithm for trees (different from the one seen in class). Evaluate the complexity of your algorithm.

3. Propose a solution for constructing connected dominating sets given a MIS.

4. Propose a solution for Maximal Matching different from the one seen in class and compute its complexity.

5. Execute both algorithms on the topology below.

Exercise 3 : Edge coloring

1. Propose a distributed algorithm for solving the edge coloring problem (no two adjacent edges in a graph have the same color). Compute its complexity !

2. Discuss practical applications of this problem ! 3. Execute the algorithm on the topology below.

TD ALGORES

MIS-DS-Matching

Références

Télécharger maintenant ( PDF - 1 Page - 46.01 KB )

Documents relatifs

TD2 ALGORES MIS-DS-Matching-BFS

Propose a distributed algorithm for solving the edge coloring problem (no two adjacent edges in a graph have the same color).. Discuss practical applications of

A New Algorithm for Solving the Rank Syndrome Decoding Problem

Abstract—In this paper, we propose an improvement of the attack on the Rank Syndrome Decoding (RSD) problem found in [1], usually the best attack considered for evaluating the

A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem

Moreover, when used for xed classes G of graphs having optimum (APSPs) compact routing schemes, the construction of an MDST of G ∈ G may be performed by using interval, linear

A Multiobjective Memetic Algorithm for Solving the Carsharing Problem

The proposed algorithm has been applied on a real problem for locating stations of a Carsharing service for electrical vehicles.. The good results we obtained in comparison to PLS

A parallel MCMC algorithm for the Balanced Graph Coloring problem

Despite these solutions are effective in producing a proper coloring, generally minimizing the number of colors, they produce highly skewed color classes, undesirable for

A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem

The Team Orienteering Problem (TOP) [4] is a widely studied Vehicle Routing Problem (VRP) which can be described as follows: a fleet of vehicles is avail- able to visit customers from

A memetic algorithm for the minimum sum coloring problem

This algorithm combines an original crossover based on the union of independent sets proposed in [1] and local search techniques dedicated to the minimum sum coloring problem

Solving the Periodic Timetabling Problem using a Genetic Algorithm

Odijk (1996) proposes the PCG (PESP Cut Generation) algorithm to generate timetables for train operations using a mathematical model consisting of periodic