Degree-constrained pyramid spanners

Journal of Parallel and Distributed Computing（1995）

引用 38|浏览0

暂无评分

摘要

A t -spanner of a pyramid network is a subnetwork in which every two nodes that were connected by an edge in the original pyramid can be connected by a path in the subnetwork with at most t edges. We give several results that present trade-offs between t and the maximum degree of a t -spanner.

查看译文

关键词

degree-constrained pyramid spanners,degree-constrained pyramid spanner,maximum degree

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要