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...
Príomhchruthaitheoir: | Law, H |
---|---|
Rannpháirtithe: | Scott, A |
Formáid: | Tráchtas |
Teanga: | English |
Foilsithe / Cruthaithe: |
2011
|
Ábhair: |
Míreanna comhchosúla
Míreanna comhchosúla
-
The complexity of graph polynomials
de réir: Noble, S, et al.
Foilsithe / Cruthaithe: (1997) -
On Weakly Distinguishing Graph Polynomials
de réir: Johann A. Makowsky, et al.
Foilsithe / Cruthaithe: (2019-04-01) -
Graph reconstruction and structure
de réir: Tan, J
Foilsithe / Cruthaithe: (2023) -
Cycles in edge-coloured graphs and subgraphs of random graphs
de réir: White, M
Foilsithe / Cruthaithe: (2011) -
Zero-patterns of polynomials and Newton polytopes
de réir: Lauder, A
Foilsithe / Cruthaithe: (2003)