The granules, glutton: An idea, an algorithm to implement on multiprocessor

  • B. Le Goff
  • P. Le Guernic
Systems Demonstrations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)


With the granules we hope to prove interesting results on graphs: the number of biggest granules that we can build would be a canonic constant of the graph which would express its complexity in the sense of connections, and then the graph of granules may be seen as the skeleton of the primitive graph.


  1. /1/.
    P. LE GUERNIC and A. BENVENISTE: Real-time synchronous, data flow programming: the language SIGNAL and its mathematical semantics. INRIA, Rennes, research report no533, June 1986.Google Scholar
  2. /2/.
    T. LENGAUER: Efficient algorithms for finding minimum spanning forests of hierarchically defined graph. Proc. of STACS 86, Springer Lecture Notes in Computer Science, No 216 (1986), 153–170.Google Scholar
  3. /3/.
    M. GONDRAN et M.MINOU: Graphes et algorithmes. Collection de la Direction des Etudes et Recherches d'Electricité de France, vol 37, EYROLLES, 1985.Google Scholar
  4. /4/.
    P.LE GUERNIC and B.LE GOFF: The granules: Partitions in "black box". INRIA, Rennes, forthcoming research report.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • B. Le Goff
    • 1
  • P. Le Guernic
    • 1
  1. 1.IRISA Campus de BeaulieuRennes CedexFrance

Personalised recommendations