Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts.
Tomas GavenciakJakub TetekPublished in: TAMC (2019)
Keyphrases
- optimal solution
- structured representation
- compact representations
- graph representation
- dynamic programming
- tree representation
- worst case
- graph model
- minimum spanning tree
- graph matching
- graph structure
- graph mining
- b tree
- binary tree
- index structure
- tree structured data
- representational power
- hierarchical tree
- spectral decomposition