arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.09764cs.DMcs.DS
收藏

加权树、块树和块图的生成

Generation of weighted trees, block trees and block graphs

Tınaz Ekim, Mordechai Shalom, Mehmet Aziz Yirik

AI总结:

本文提出一个通用框架,通过推广质心概念和质心根规范加权树生成带颜色和权重的树,并实现线性输出延迟枚举,成功应用于生成与连通块图一一对应的加权块树。

摘要:

我们提出了一个通用框架,用于生成每个顶点都具有非负权重和一种颜色的树。颜色用于对其他顶点的权重和颜色施加特定限制。我们首先扩展了文献[19, 20]中给出的无权树枚举算法,以生成允许零权重的加权树。我们通过将质心概念推广到加权树,并使用所谓的质心根规范加权树来避免同构。我们给出了unranking算法的时间复杂度分析,并证明了枚举的输出延迟复杂度是线性的。该框架可利用基于树的分解/表示来生成图类。我们通过生成与连通块图一一对应的加权块树来演示我们的框架。所有不超过19个顶点的连通块图已在[1]中公开提供。

英文摘要:

We present a general framework to generate trees every vertex of which has a non-negative weight and a color. The colors are used to impose certain restrictions on the weight and colors of other vertices. We first extend the enumeration algorithms of unweighted trees given in [19, 20] to generate weighted trees that allow zero weight. We avoid isomorphisms by generalizing the concept of centroids to weighted trees and then using the so-called centroid-rooted canonical weighted trees. We provide a time complexity analysis of unranking algorithms and also show that the output delay complexity of enumeration is linear. The framework can be used to generate graph classes taking advantage of their tree-based decompositions/representations. We demonstrate our framework by generating weighted block trees which are in one-to-one correspondence with connected block graphs. All connected block graphs up to 19 vertices are publicly available at [1].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑