Multicasting in the hypercube, chord and binomial graphs

Christopher C. Cipriano,Teofilo F. Gonzalez

Information Processing Letters（2010）

引用 3|浏览0

暂无评分

摘要

We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish that the sp-multicast (shortest path) and Steiner tree problems for the n-cube, Chord and the BNG network are NP-Complete, even when every destination vertex is at a distance two from the source vertex.

查看译文

关键词

multicasting,close variant,simple transformation,destination vertex,shortest path,n-cube,np-complete,binomial graphs,chord,steiner tree problem,source vertex,n-cube network,binomial graph,steiner trees.,bng network,steiner trees,np complete,algorithms,steiner tree

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要