Counting Vines
Oswaldo Morales‐Nápoles · Dependence Modeling · 2010
AbstractIn this chapter, three algorithms for producing and enumerating regular vines are presented. The first one produces all possible vines on n nodes and regular vines are found by inspection. The second one uses the concept of line graphs to produce only regular vines. The third algorithm produces regular vines by extending a regular vine on three nodes to a regular vine on n nodes. The first and second algorithms presented have been used for the construction of a catalogue of labeled regular vines on at most nine nodes and tree-equivalent regular vines on at most seven. This catalogue is presented as an appendix to the chapter.