Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Gavoille, Cyril Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  Distance labeling in graphs
Gavoille C., Peleg D., Pérennes S., Raz R. Journal of Algorithms 53(1): 85-112, 2004.  Type: Article

This paper mainly addresses the problem of efficiently labeling graphs in such a way that the distance between two nodes of the graph can be computed only from their labels. Of course, it is desirable to have the maximum length of a la...
...
Jan 26 2005  
  Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Fraigniaud P., Gavoille C., Mans B.  Principles of distributed computing (Proceedings of the nineteenth annual ACM symposium, Portland, Oregon, United States, 11-20, 2000.  Type: Proceedings

The paper provides an alternative, more efficient leader-election technique for any graph labeled by a shortest path interval routing scheme....
...
Jul 8 2002  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy