Abstract
Graph representation is a flexible and general-purpose tool to represent structured data, it is widely used in various fields, such as circuit design, concept representation, image cognition and so on. It is very significant to detect beneficial information and to retrieve specific substructures from a graph database. However, the computational cost of algorithms using graph representation is huge in general, a quick subgraph isomorphism detection algorithm is required [1], [2]
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Cook, D. J. and Holder, L. B., Substructure Discovery Using Minimum Description Length and Background Knowledge, Journal of Artificial Intelligence Research, 1, 231–255 (1994).
Messmer, B.T. and Bunke, H., A Network Based Approach to Exact and Inexact Graph Matching, Technical Report, LM-93-021, University of Berne, (1993).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakanishi, Y., Uehara, K. (1998). Parallel Organization Algorithm for Graph Matching and Subgraph Isomorphism Detection. In: Arikawa, S., Motoda, H. (eds) Discovey Science. DS 1998. Lecture Notes in Computer Science(), vol 1532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49292-5_44
Download citation
DOI: https://doi.org/10.1007/3-540-49292-5_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65390-5
Online ISBN: 978-3-540-49292-4
eBook Packages: Springer Book Archive