Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model

arxiv（2022）

引用 1|浏览3

暂无评分

摘要

BSTRACTWe present round complexity results in the CONGEST model for Replacement Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We study these fundamental problems in both directed and undirected graphs, weighted and unweighted.

查看译文

关键词

replacement paths,near optimal bounds

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要