loading...
An Algorithm to Search Minimal Subtree Graphs
Xi'an, Chin September 10-September 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPPW.2007.202007 International Conference on Para ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Jing Wang, Ying Li, Xinmei Wang, "An Algorithm to Search Minimal Subtree Graphs," Parallel Processing Workshops, International Conference on, pp. 39, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ICPPW.2007.20,
author = {Jing Wang and Ying Li and Xinmei Wang},
title = {An Algorithm to Search Minimal Subtree Graphs},
journal ={Parallel Processing Workshops, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2934-8},
pages = {39},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPPW.2007.20},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Processing Workshops, International Conference on
TI - An Algorithm to Search Minimal Subtree Graphs
SN - 0-7695-2934-8
SP
EP
A1 - Jing Wang,
A1 - Ying Li,
A1 - Xinmei Wang,
PY - 2007
KW - network coding
KW - multicast routing graph
KW - information flow
KW - minimal subtree graph
VL - 0
JA - Parallel Processing Workshops, International Conference on
ER -
 
Jing Wang, Xidian University, China
Ying Li, Xidian University, China
Xinmei Wang, Xidian University, China
In this paper, we first propose an algorithm to obtain multicast routing graph. The multicast routing algorithm with network coding will consume lesser resource, and is much closer to minimum-cost multicast. A scheme to search minimal subtree graph is presented based on the chosen routing graph. Moreover, upon the minimal subtree graph obtained, we can effectively construct network coding. Then all the network coding problems can be reduced to search the minimal subtree graphs.
Index Terms:
network coding, multicast routing graph, information flow, minimal subtree graph
Citation:
Jing Wang, Ying Li, Xinmei Wang, "An Algorithm to Search Minimal Subtree Graphs," icppw, pp.39, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.