This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1995). UBS-Graph rewriting systems — matching subgraphs in constant time. In: Dörr, H. (eds) Efficient Graph Rewriting and Its Implementation. Lecture Notes in Computer Science, vol 922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031912
Download citation
DOI: https://doi.org/10.1007/BFb0031912
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60055-8
Online ISBN: 978-3-540-49419-5
eBook Packages: Springer Book Archive