1 |
S. Boyd, "Applications of Combinational Optimization: Optimal Paths and Trees," http://www.site.uottawa.ca /-sylvia/csi5166web/5166tespg26to61.pdf, School of Information Technology and Engineering (SITE), University of Ottawa, Canada, 2005.
|
2 |
C. Duhamel, L. Gouveia, P. Moura, and M. C. Souza, "Models and Heuristics for a Minimum Arborescence Problem," Research Report LIMOS /RR-04-13, http://www.isima.fr/limos/publi/ RR-04-13.pdf, 2004.
|
3 |
S. J. Yang, "The Directed Minimum Spanning Tree Problem," http://www.ce.rit.edu/-sjyeec/dmst.html, 2000.
|
4 |
A. Schrijver, "Advanced Graph Theory and Combinatorial Optimization," Dept. of Mathematics, University of Amsterdam, Netherlands, http://citeseer.ist.psu.edu/schrijver01advanced.html, 2001.
|
5 |
N. Bezroukov, "Minimum Spanning Trees," Softpanorama, http://www.softpanorama.org/Algorithms/Digraphs/mst.shtml, 2006.
|
6 |
Wikipedia, "Tree(Graph Theory)," http://en.wikipedia.org/wiki/Tree_graph_Theory/, 2007.
|
7 |
R. Krishnam, B and Raghavachari, "The Directed Minimum-Degree Spanning Tree Problem," FSTTCS 2001, LNCS 2245, pp. 232-243, 2001.
|
8 |
T. UNO, "An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph," International Symposium on Algorithm and Computation(ISAAC96), pp. 166-173, 1996.
|
9 |
M. Llewellyn, "COP 3503: Computer Science II - Introduction to Graphs," http://www.cs.ucf.edu/courses/cop3503/summer04, 2004.
|
10 |
K. Ikeda, "Mathematical Programming," Dept. Information Science and Intelligent Systems, The University of Tokushima, http://www-b2.is. tokushima-u.ac.jp/-ikeda/suuri/maxflow/ Maxflow App.shtml. 2005.
|
11 |
WWL. Chen, "Discrete Mathematics," Department of Mathematics, Division of ICS, Macquarie University, Australia, http://www.maths.mq.edu.au/-wchen/lndmfolder/ lndm.html, 2003.
|
12 |
R. Wenger, "CIS 780: Analysis of Algorithms," http://www.cse.ohio-state.edu/-wenger/cis780/ shortest_path.pdf, 2004.
|
13 |
J. R. N. Forbes, "CPS196.2 Robotics: Graphs and Matrices," http://www.cs.duke.edu/courses/ cps196.2/fall03/pdf/graphs_and_matrices.pdf
|
14 |
C. List, "MT303: Operations Research Graphs & Networks - Handout 3," Department of Mathematics, National University of Ireland, http://www,maths.may.ie/clist/teching/netw_handout_3. pdf, 2003.
|
15 |
이용진, 이동우, "WSN의 최소비용 신장트리 문제와 휴리스틱 알고리즘," 한국정보기술학회논문지, 제7권, 제4호, pp. 275-282, 2009.
|
16 |
박양재, 이정현, "무선 이동 에드 혹 네트워크에서 효율적인 코어- 기반 멀티캐스트 트리," 한국정보기술학회논문지, 제1권, 제1호, pp. 32-44, 2003.
|
17 |
임은기, "자료흐름도로부터 데이터베이스 테이블 설계순서를 추출하는 알고리즘," 한국정보기술학회논문지, 제5권, 제4호, pp. 226-233, 2007.
|
18 |
Wikipedia, http://en.wikipedia.org/wiki/Minimum _spanning_tree, Wikimedia Foundation Inc., 2007.
|
19 |
O. Boruvka, "O Jistem Problemu Minimalnim," Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No. 3, pp. 37-58, 1926.
|
20 |
J. Nesetril, E. Milkov'a, and H. Nesetrilov'a, "Otakar Boruvka on Minimum Spanning Tree Problem (Translation of the both 1926 Papers, Comments, History)," DMATH: Discrete Mathematics, Vol. 233, 2001.
|
21 |
R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol. 36, pp. 1389-1401, 1957.
DOI
|
22 |
J. B. Kruskal, "On the Shortest Spanning Subtree and The Traveling Salesman Problem," Proceedings of the American Mathematical Society, Vol. 7, pp. 48-50, 1956.
DOI
ScienceOn
|
23 |
P. A. Jensen, "Operations Research Models and Methods," John Wiley and Sons, 2003.
|