loading...
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs
Maui, Hawaii January 03-January 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.1997.66721430th Hawaii International Conference ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Interconnection networks (the topological structure of parallel and distributed systems) are generally modeled as graphs. Consequently, researchers have been investigating those structural properties of graphs that correspond to useful properties of interconnection net-works. One such property that has recently been investigated is the existence of spanners in a graph.
Citation:
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau, "Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs," hicss, vol. 1, pp.191, 30th Hawaii International Conference on System Sciences (HICSS) Volume 1: Software Technology and Architecture, 1997
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions