DBHT: private API
PortfolioOptimisers.DBHTRootMethod — Type
abstract type DBHTRootMethod <: AbstractAlgorithmAbstract supertype for all Direct Bubble Hierarchical Tree (DBHT) root selection methods.
CliqHierarchyTree2s chooses the root when it builds the clique hierarchy of the planar graph. A hierarchy needs one node with no parent, and the planar clique tree can give several candidates. A member of this family selects the rule that makes one root from them.
The candidates are the maximal 3-cliques of the graph, and there can be more than one. The hierarchy of [126] is then a forest with one tree for each of them. [127] states no rule for the choice. The two members come from the MATLAB code that accompanies it.
Related
References
- [126] W.-M. Song, T. Di Matteo and T. Aste. Nested hierarchies in planar graphs. Discrete Applied Mathematics 159, 2135–2146 (2011). Theorem 2.8 and Corollary 3.6.
References
- [126]
- W.-M. Song, T. D. Matteo and T. Aste. Nested hierarchies in planar graphs. Discrete Applied Mathematics 159, 2135–2146 (2011).
- [127]
- W.-M. Song, T. Di Matteo and T. Aste. Hierarchical information clustering by means of topologically embedded graphs. PloS one 7, e31929 (2012).