Percolationby links appliedto the minimum spanning tree problem

23rd International Conference on Electronics, Communications and Computing, CONIELECOMP 2013

Volumn , Issue , 2013, Pages 67-73

  Calderon Segura, Yessica ^a   Burlak, G ^a   Martinez Rangel, Martin G ^a   Ochoa, Alberto ^b   Martinez Oropeza, Alina ^a  

^a UNIVERSIDAD AUTÓNOMA DEL ESTADO DE MORELOS   (Mexico)

^b Juarez City University   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

INITIAL POPULATION; MINIMUM SPANNING TREE PROBLEM; MINIMUM SPANNING TREES; RUNNING TIME; SQUARE LATTICES; STRUCTURAL QUALITIES;

ALGORITHMS; CRYSTAL LATTICES; DIRECTED GRAPHS; OPTIMIZATION;

SOLVENTS;

EID: 84881038724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CONIELECOMP.2013.6525761     Document Type: Conference Paper

References (22)

1. Andrade JS, Buldyrev SV, Dokholyan NV, Halin S, Lee Y, King PR, Stanley HE;'Flow between two sites in percolation sys- tem?.Phys Rev E 62 8270-8281,2000.
2. Jacob van den Ber, DemeterKiss and Pierre Nolin'A percolation process on the binary tree where large cluster are frozen?. Phys Rev E. arXiv:1105.1977v1. pp 1-11. 10 may 2011.
3. Mathieu, Cristoph Temmel.?K- Independient Percolation on trees?. Rev math.PR.arXiv:1103.129lv3[math]. Pp 14-28, 30 mayo 2012.
4. G.Claussen,L.Apolo, O. Melchert and A.K. Hartmann.?Analysis os the loop length dis- tribution for the naggative weight percola- tion problem in dimensions d=2 through 6?. Rev math. arXiv:1207.2893v1, 12 julio 2012.
5. G.Burlak,A. Díaz-de-anda, Yu. Karlovich, A.B. Klimov.?Critical behavior of nanome- ter radiation in percolation mater- ial?Physics letters A. 373(2009) pp 1492-1499.
6. G.Burlak,A, M. Vlasova, P.A. Márquez Aguilar, M. kakazey, L. Xixitla- Cheron.?OPtical percolation in ceramics assited by porous clusters?, volume 282, 15 july 2009, ISSN 0030-4018. Pp. 2850-2856.
7. R. Mosgorf, T. Wyszkowski.'Experimental investigations of deterministics chaos appearance in bubbling low?. International journal of heat and Mass Transfer 54(2001) 5060-5069.
8. Estrella Laredo, Alfredo Bello, Mario Grimau. Percolación, Universali- dad y Propiedades de Nano com- puestos poliméricos/nanotubos de car- bonno,PCL/PLA/NTC. Rev. LatinAm. Metal. Mat.: Memorias del XIV Colo- quio Venezolano de Polímeros, ISBN: 5219-525225. S3 2-3, Abril 2011.
9. T. Gregory Dewey. Fractals in Molecular Biophysics. Depart of chemistry university of Denver, Oxford New York, Oxford University Press 1997.
10. R. Mosdorf., T Wyszkowki. Experimental Investigation of deterministic chaos appear- ances in bubbling low. Rev. International Journal of Heat and Mass Transfer 54(2011) 5060-5069., ISNB: 0017-9310.
11. King PR, Buldyrev SV, Dokholyan NV, Havlin S, Lee Y, Paul G, Stanley HE &Vandesteeg N; predicting oil recovery using percolation theory. Petroleum Geoscience 7 S105-S107 2001.
12. Armin Bunde., Paul Heitjans, Sylvio In- diris. Anomalous Transport and Diusion in Percolation Systems Diusion Fundamentals 6 (2007) 9.1 - 9.17.
13. Brooks, R.H. y A.T. Corey. 1964. Hydraulic properties of porous media. Hydro. Peg. 3, Colorado State University, Fort Collins.
14. D. Stauer and A. Aharony. Introduction to Percolation Theory. Taylor and Francis, 2nd edition, 1994.
15. Estéfane George Macedo de Lacerda., Ma- noel Firmino de Madeiros Junior. A genetic algorithm for the capacitated min- imums spanning tree problem. Revista IEEE congress on Evolutionary Computation, Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada, July 16- 2006.ISSN:0-7803-9487-9.
16. Chunbao Zhou., Liming Wan., Yanchun Liang. A Hybrid Algorithm of Minimum Spanning Tree and Nearest Neighbor for Classifying Human Cancers. 3rd Interna- tional Conference on Advanced Computer Theory and Engineering (ICACTE). v5- 585.,2010. ISSN 978-1-4244-6542-2.
17. Zahra Naji-Azimi, Majid Salari, Burce Golden S, Raghavan, Paolo Tooth. Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. Computers and Operations Research 37,(2010) 1952-1964. ISSN: 0305- 0548.
18. Frank Neumann, Ingo Wegener. Random- ized local search, evolutionary algorithms, and the minimum spanning tree problem. Rev. Theoretical Computer Science 378, (2007), 32-40,08 de November 2007. ISSN: 0304-3975.
19. He Fangguo, Qi Huan. A Model and Algo- rithm for Minimum Spanning Tree Prob- lems in uncertain networks. The 3rd In- ternational Conference on Innovative Com- puting Information and Control (ICI- CIC?08).IEEE Computer Society.(2008), ISSN:978-0-7695-3161-8.
20. Oleksandr Grygorash, Yan Zach Jorgensen. Minimum Spanning Tree Based Clustering Algorithms, Proceedings of the 18th IEEE International Conference on Tools with Arti?cial Intelligence (ICTAI?06). IEEE .(2006),ISSN: 0-7695-2728-0.
21. T.S. Jackson and N.Read.?Theory of minimum spanning trees II:exactect graphical methods and perturbation expansion at the percolation thresh- old?.Departament of physical. Rev math.PR.arXiv:0909.5343V1[Cond- mat.dis-nn] .29 sep-2009
22. Londoño C.,Libardo A., Daniel; Arroyave Z., Juan E.; Longas A., Dayro G. Sis- temas de Información Geográ?ca(SIG) y Teoría de percolación aplicados al estudio de fenómenos de propagación en Epidemi- ología. Rev Avances en sistemas e Infor- mática, Vol.4,núm.1, Junio, 2007, pp.23-31. Universidad Nacional de Colombia Medel- lín, Colombia.