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...
Hovedforfatter: | Law, H |
---|---|
Andre forfattere: | Scott, A |
Format: | Thesis |
Sprog: | English |
Udgivet: |
2011
|
Fag: |
Lignende værker
-
The complexity of graph polynomials
af: Noble, S, et al.
Udgivet: (1997) -
On Weakly Distinguishing Graph Polynomials
af: Johann A. Makowsky, et al.
Udgivet: (2019-04-01) -
Graph reconstruction and structure
af: Tan, J
Udgivet: (2023) -
Cycles in edge-coloured graphs and subgraphs of random graphs
af: White, M
Udgivet: (2011) -
Zero-patterns of polynomials and Newton polytopes
af: Lauder, A
Udgivet: (2003)