Asymptotic normality for the size of graph tries built from M-ary tree labelings.
Michael FuchsTsan-Cheng YuPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- maximal cliques
- graph structure
- bounded degree
- minimum spanning tree
- tree structure
- spanning tree
- hierarchical data structure
- tree shaped
- weighted graph
- graph model
- graph theoretic
- graph theory
- equivalence class
- lower bound
- random walk
- index structure
- bipartite graph
- structured data
- hierarchical structure
- r tree
- equivalence classes
- binary tree
- directed graph
- data structure
- maximum weight
- tree nodes
- expected values
- clique tree
- query language
- b tree