Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme

标题
Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme
作者
关键词
-
出版物
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Volume 134, Issue -, Pages 104-115
出版商
Elsevier BV
发表日期
2019-08-28
DOI
10.1016/j.jpdc.2019.08.006

向作者/读者发起求助以获取更多资源

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now