Indexing Structure for Graph-Structured Data

DOI10.1007/978-3-540-88067-7_10MaRDI QIDQ3627908zbMATH OpenOpenAlexFDO

Authors Stanislav Bartoň, Pavel Zezula

Publication date 13 May 2009

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88067-7_10

zbMATH Keywords

\(\rho \)-index on graphssearch algorithm

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Q-trees -- efficient retrieval of graphs by means of structure invariants.
• Investigations on Path Indexing for Graph Databases
• Study of similar graph containment search and index
• An indexing framework for queries on probabilistic graphs
• scientific article; zbMATH DE number 1982644

Cites work

• A Theorem on Boolean Matrices
• A transitive closure algorithm
• A Unified Approach to Path Problems
• An algorithm for information structuring and retrieval
• Depth-First Search and Linear Graph Algorithms
• Fast Algorithms for Solving Path Problems
• scientific article; zbMATH DE number 432779 (Why is no real title available?)
• scientific article; zbMATH DE number 2119758 (Why is no real title available?)

Cited in

(1)

• Investigations on Path Indexing for Graph Databases

This page was built for publication: Indexing Structure for Graph-Structured Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627908)