106 articles – 48 references  [version française]
.:. Browse > List by date > 2002 .:.
3 documents ordered by :
A characterization of families of graphs in which election is possible
Godard E., Métivier Y.
In Foundations of Software Science and Computation Structures - Foundations of System Specification and Computation Structures (FoSSaCS) (EATCS best paper award), Spain (2002) [hal-00307375 - version 1]
Termination detection of distributed algorithms
Godard E., Métivier Y., Mosbah M., Sellami A.
In Graph transformation - International conference on graph transformation (ICGT), Spain (2002) [hal-00307374 - version 1]
Augmenting trees to meet connectivity and diameter constraints
Chepoi V., Vaxès Y.
Algorithmica 33 (2002) 243-262 [hal-00005260 - version 1]