A fast retrieval technique for large graph structures

DOI10.1080/00207169608804487MaRDI QIDQ2710761zbMATH OpenOpenAlexFDO

Authors Hirokazu Iriguchi, Masashi Koyama, Masami Shishibori, Jun-ichi Aoe

Publication date 19 December 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169608804487

zbMATH Keywords

data compressingfinite automatagraph structuresstoring and retrievingworst-case time complexity

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Formal languages and automata (68Q45)

Cites work

• An algorithm for dynamic processing of dawg's
• Compressed tries
• Efficient string matching
• scientific article; zbMATH DE number 423663 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Storing a sparse table

Cited in

(1)

• An efficient representation for implementing finite state machines based on the double-array

This page was built for publication: A fast retrieval technique for large graph structures

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