Opening book details…
Can I read Spanning Tree Congestion of the Hypercube on EtoBox?
Spanning Tree Congestion of the Hypercube by Hiu-Fai Law is a Computer Science article available to read on EtoBox.
What is Spanning Tree Congestion of the Hypercube about?
Let G be a finite connected graph and T be a spanning tree. For any edge e of T , let A e , B e be the components of T \ e. The edge congestion of e in T is defined as ec G (e, T ) = |{uv | u ∈ A e , v ∈ B e }|, and the congestion of T is the maximum of ec G (e, T ) over all edges of T . Then the spanning tree congestion s(G) of G is the minimum of congestion
Who reads Spanning Tree Congestion of the Hypercube?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Hiu-Fai Law
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2009
- Language
- EN
- Field
- Computer Science (Physical Sciences)