Abstract
To avoid paradoxes in parallel graph rewriting, it is desirable to forbid overlapping instances of a subgraph to be rewritten simultaneously. The selection of maximal sets of nonoverlapping instances corresponds to the selection of maximal independent sets of nodes in a derived graph. This note briefly examines the process of repeatedly selecting such sets of nodes. It shows that doing so “decimates” the graph in the sense that the number of nodes shrinks exponentially; but that unfortunately, the degree of the graph may grow exponentially.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosenfeld, A. (1991). A note on graph decimation. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017418
Download citation
DOI: https://doi.org/10.1007/BFb0017418
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive