arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0102009cs.DScs.DM
收藏

线性时间中二部逐点双连通的最优增广

Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time

Tsan-sheng Hsu, Ming-Yang Kao

摘要:

一个图是按分量双连通的,如果每个连通分量是孤立点或双连通。我们提出了一个线性时间算法的问题,增加最小数量的边缘,使一个二分图的组件双连通,同时保持其二分性。该算法对保护统计表中的敏感信息具有直接的应用价值。

英文摘要:

A graph is componentwise biconnected if every connected component either is an isolated vertex or is biconnected. We present a linear-time algorithm for the problem of adding the smallest number of edges to make a bipartite graph componentwise biconnected while preserving its bipartiteness. This algorithm has immediate applications for protecting sensitive information in statistical tables.

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

↑