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...
| প্রধান লেখক: | |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | গবেষণাপত্র |
| ভাষা: | English |
| প্রকাশিত: |
2011
|
| বিষয়গুলি: |