Trees and graphs: congestion, polynomials and reconstruction
<p>Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can perform if only minimal connection can be maintained. We compute the parameter for several families of graphs. In particular, by partitioning a hypercube into pieces with almost optimal edge-bou...
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2011
|
| 主題: |