Efficient component-hypertree construction based on hierarchy of partitions
2019
The component-hypertree is a data structure that generalizes the concept of component-tree to multiple (increasing) neighborhoods. However, construction of a component-hypertree is costly because it needs to process a high number of neighbors. In this article, we review some choices of neighborhoods for efficient component-hypertree computation. We also explore a new strategy to obtain neighboring elements based on hierarchy of partitions, leading to a more efficient algorithm with the counterpart of a slight decrease of precision on the distance of merged nodes.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
25
References
3
Citations
NaN
KQI