Edge disjoint spanning trees and failure recovery in data communication networks
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983.
Main Author: | Roskind, James Anthony |
---|---|
Other Authors: | Robert G. Gallager. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/15483 |
Similar Items
-
Length 3 Edge-Disjoint Paths Is NP-Hard
by: Alpert, Hannah, et al.
Published: (2017) -
Approximation algorithms for disjoint paths problems
by: Kleinberg, Jon M
Published: (2005) -
Faster generation of random spanning trees
by: Ma̧dry, Aleksander
Published: (2010) -
The complexity of quantum disjointness
by: Klauck, Hartmut
Published: (2018) -
Time optimal self-stabilizing spanning tree algorithms
by: Aggarwal, Sudhanshu Madan
Published: (2007)