赋权图的在线拓扑化简
On-line topological simplification of weighted graphs
摘要：
我们描述了两个有效的在线算法来简化加权图通过消除度2顶点。我们的算法是在线的，因为它们对数据的更新做出反应，使简化保持最新。支持的更新是顶点和边的插入，因此，我们的算法是部分动态的。我们提供了我们的方法的效率分析和实证评估。具体来说，我们证明了我们的维护算法的摊销时间复杂度的O（log n）上界，与n的插入数。
英文摘要：
We describe two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line in that they react to updates on the data, keeping the simplification up-to-date. The supported updates are insertions of vertices and edges; hence, our algorithms are partially dynamic. We provide both analytical and empirical evaluations of the efficiency of our approaches. Specifically, we prove an O(log n) upper bound on the amortized time complexity of our maintenance algorithms, with n the number of insertions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
