Please use this identifier to cite or link to this item:
Title: Indexing Tree Structures through Caterpillar Decomposition
Authors: Yılmaz, Fadi
Demirci, Muhammed Fatih
Keywords: shape retrieval
caterpillar decomposition
Issue Date: 2011
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.
ISBN: 978-3-642-21227-7
ISSN: 0302-9743
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

Page view(s)

checked on Feb 6, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.