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...
第一著者: | Law, H |
---|---|
その他の著者: | Scott, A |
フォーマット: | 学位論文 |
言語: | English |
出版事項: |
2011
|
主題: |
類似資料
-
The complexity of graph polynomials
著者:: Noble, S, 等
出版事項: (1997) -
On Weakly Distinguishing Graph Polynomials
著者:: Johann A. Makowsky, 等
出版事項: (2019-04-01) -
Graph reconstruction and structure
著者:: Tan, J
出版事項: (2023) -
Cycles in edge-coloured graphs and subgraphs of random graphs
著者:: White, M
出版事項: (2011) -
Zero-patterns of polynomials and Newton polytopes
著者:: Lauder, A
出版事項: (2003)