Minimum congestion spanning trees of grids and discrete toruses

Minimum congestion spanning trees of grids and discrete toruses
复制标题

跨越网格树和离散圆环的最小拥塞

DOI:
10.7151/dmgt.1461
复制
发表时间:
2009
期刊:
Discuss. Math. Graph Theory
影响因子:
--
通讯作者:
M. Ostrovskii
M. Ostrovskii
中科院分区:
--
文献类型:
--
作者:
A. Castejón;M. Ostrovskii

文献摘要

被引文献

相似文献

本文致力于估计网格图和二维和三维离散环面的生成树拥塞。
The paper is devoted to estimates of the spanning tree congestion for grid graphs and discrete toruses of dimensions two and three.