Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/6889
Title: | Indexing Tree Structures Through Caterpillar Decomposition | Authors: | Yılmaz, Fadi Demirci, Muhammed Fatih |
Keywords: | shape retrieval indexing caterpillar decomposition |
Publisher: | Springer-Verlag Berlin | Source: | 17th Scandinavian Conference on Image Analysis (SCIA) -- MAY 23-27, 2011 -- Ystad, SWEDEN | Series/Report no.: | Lecture Notes in Computer Science | Abstract: | Graphs provide effective data structures modeling complex relations and schemaless data such as images, XML documents, circuits, compounds, and proteins. Given a query graph, efficiently finding all database graphs in which the query is a subgraph is an important problem raising in different domains. In this paper, we propose a new method for indexing tree structures based on a graph-theoretic concept called caterpillar decomposition and discuss its advantages over two previous indexing algorithms. Experimental evaluation of the proposed framework including the comparison with the previous approaches demonstrates the efficacy of the overall approach. | URI: | https://hdl.handle.net/20.500.11851/6889 | ISBN: | 978-3-642-21227-7 | ISSN: | 0302-9743 1611-3349 |
Appears in Collections: | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
WEB OF SCIENCETM
Citations
2
checked on Oct 5, 2024
Page view(s)
58
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.