CORC

浏览/检索结果: 共7条,第1-7条 帮助

已选(0)清除 条数/页:   排序方式:
Minimax regret 1-sink location problem in dynamic path networks 会议论文
作者:  Higashikawa, Yuya;  Augustine, John;  Cheng, Siu-Wing;  Golin, Mordecai J.;  Katoh, Naoki
收藏  |  浏览/下载:4/0  |  提交时间:2019/12/02
Minimax regret 1-sink location problem in dynamic path networks 期刊论文
Theoretical Computer Science, 2015, 卷号: Vol.588, 页码: 24-36
作者:  Yuya Higashikawa;  John Augustine;  Siu-Wing Cheng;  Mordecai J. Golin;  Naoki Katoh
收藏  |  浏览/下载:10/0  |  提交时间:2019/03/26
The asymptotic number of spanning trees in circulant graphs 期刊论文
DISCRETE MATHEMATICS, 2010, 卷号: 310, 期号: 4, 页码: 792-803
作者:  Golin, Mordecai J.;  Yong, Xuerong;  Zhang, Yuanping
收藏  |  浏览/下载:7/0  |  提交时间:2019/11/15
The number of spanning trees in a class of double fixed-step loop networks 期刊论文
NETWORKS, 2008, 卷号: 52, 期号: 2, 页码: 69-77
作者:  Yong, Xuerong;  Zhang, Yuanping;  Golin, Mordecai J.
收藏  |  浏览/下载:4/0  |  提交时间:2019/11/15
The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract) 会议论文
作者:  Golin, Mordecai J.;  Yong, Xuerong;  Zhang, Yuanping
收藏  |  浏览/下载:7/0  |  提交时间:2019/11/15
The asymptotic number of spanning trees in circulant graphs 会议论文
New Orleans, LA, United states, January 6, 2007 - January 6, 2007
作者:  Golin, Mordecai J.;  Yong, Xuerong;  Zhang, Yuanping
收藏  |  浏览/下载:20/0  |  提交时间:2020/11/15
Chebyshev polynomials and spanning tree formulas for circulant and related graphs 会议论文
作者:  Zhang, Yuanping;  Yong, Xuerong;  Golin, Mordecai J.
收藏  |  浏览/下载:22/0  |  提交时间:2020/11/15


©版权所有 ©2017 CSpace - Powered by CSpace