Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Bibliography
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.
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.
M. GONDRAN et M.MINOU: Graphes et algorithmes. Collection de la Direction des Etudes et Recherches d'Electricité de France, vol 37, EYROLLES, 1985.
P.LE GUERNIC and B.LE GOFF: The granules: Partitions in "black box". INRIA, Rennes, forthcoming research report.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Goff, B., Le Guernic, P. (1988). The granules, glutton: An idea, an algorithm to implement on multiprocessor. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035866
Download citation
DOI: https://doi.org/10.1007/BFb0035866
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive