A fast retrieval technique for large graph structures

Graphs are a typical and basic data structure for computer algorithms. A two-dimensional array and a list are well-known as for their representation. These data representations have contrasting features for retrieval time and space efficiency. Aho et al. [3] proposed a method for combining the compa...

Full description

Saved in:

Bibliographic Details
Published in:	International Journal of Computer Mathematics Vol. 60; no. 3-4; pp. 215 - 228
Main Authors:	Iriguchi, Hirokazu, Koyama, Masashi, Shishibori, Masami, Aoe, Jun-Ichi
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01.01.1996 Informa UK Limited Taylor and Francis
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science; control theory; systems Data compressing Exact sciences and technology F.2.2[Nonnumerical Algorithms and problems] Finite automata Graph structures H.3.3[Information search and retrieval] Information retrieval. Graph Performance E.1 Data Structure[Graphs] Storing and retrieving Theoretical computing Worst-case time complexity Data compression Worst case method Information retrieval Finite automaton Graph theory Data structure Algorithm Time complexity
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!