ASA-graphs for efficient data representation and processing
From MaRDI portal
Publication:2023584
DOI10.34768/amcs-2020-0053zbMath1503.68051OpenAlexW3118773481MaRDI QIDQ2023584
Daniel Bulanda, Adrian Horzyk, Janusz A. Starzyk
Publication date: 3 May 2021
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://sciendo.com/pdf/10.34768/amcs-2020-0053
graphsdata access efficiencyassociative structuresrepresentation of relationshipsself-aggregating data structuresself-balancing treesself-sorting trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concurrent operations on \(B^ *\)-trees with overtaking
- Closest paths in graph drawings under an elastic metric
- Ant-based clustering for flow graph mining
- Organization and maintenance of large ordered indexes
- Rank-Balanced Trees
- Dynamic Optimality—Almost
- OPTIMAL OPERATIONS ON RED-BLACK TREES
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
This page was built for publication: ASA-graphs for efficient data representation and processing