Libros sobre el tema "Trees (graph theory)"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores mejores libros para su investigación sobre el tema "Trees (graph theory)".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore libros sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
1960-, Chauvin Brigitte, Cohen Serge 1964-, Rouault Alain 1949- y Workshop on Trees (1995 : Versailles, France), eds. Trees: Workshop in Versailles, June 14-16, 1995. Basel: Birkhäuser, 1996.
Buscar texto completoLimnios, N. Fault trees. London, UK: ISTE, 2007.
Buscar texto completoIntroduction to [lambda]-trees. Singapore: World Scientific, 2001.
Buscar texto completoA, Evstigneev V., ed. Graph theory for programmers: Algorithms for processing trees. Dordrecht: Kluwer Academic, 2000.
Buscar texto completoCrouch, Peter. Trees, bialgebras and intrinsic numerical algorithms. Chicago, IL: Dept. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 1990.
Buscar texto completoDingzhu, Du, Smith J. M y Rubinstein J. H, eds. Advances in Steiner trees. Dordrecht: Kluwer Academic, 2000.
Buscar texto completoRubin, Matatyahu. The reconstruction of trees from their automorphism groups. Providence, R.I: American Mathematical Society, 1993.
Buscar texto completoKloks, Ton. Treewidth: Computations and approximations. Berlin: Springer-Verlag, 1994.
Buscar texto completoKasʹi͡anov, V. N. Graph theory for programmers: Algorithms for processing trees. Dordrecht: Kluwer Academic, 2000.
Buscar texto completoLeister, Karen J. Using minimal spanning trees to compare the reliability of network topologies. Hampton, Va: Langley Research Center, 1990.
Buscar texto completoScheffler, Petra. Linear-time algorithms for NP-complete problems restricted to partial k-trees. Berlin: Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik, 1987.
Buscar texto completoHougen, Darrell R. Fast texture recognition using information trees. Urbana, IL (1304 W. Springfield Ave., Urbana 61801): Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1988.
Buscar texto completoN, Kasʹi͡a︡nov V. y Kotov Vadim Evgenʹevich, eds. Algoritmy obrabotki derevʹev. Novosibirsk: Akademii͡a︡ nauk SSSR, Sibirskoe otd-nie, Vychislitelʹnyĭ t͡s︡entr, 1990.
Buscar texto completoN, Kasʹi͡a︡nov V., ed. Algoritmy na derevʹi͡a︡kh. Novosibirsk: Akademii͡a︡ nauk SSSR, Sibirskoe otd-nie, Vychislitelʹnyĭ t͡s︡entr, 1989.
Buscar texto completoN, Kasʹi͡a︡nov V. y Kotov Vadim Evgenʹevich, eds. Teorii͡a︡ grafov: Algoritmy obrabotki derevʹev. Novosibirsk: VO "Nauka", 1994.
Buscar texto completoIndian Institute of Management, Ahemdabad., ed. A probabilistic tabu search algorithm for the generalized minimum spanning tree problem. Ahmedabad: Indian Institute of Management, 2003.
Buscar texto completoBarthélemy, Jean-Pierre. Trees and proximity representations. Chichester: Wiley, 1991.
Buscar texto completoF, Le Gall J., ed. Random trees, Lévy processes, and spatial branching processes. Paris, France: Société mathématique de France, 2002.
Buscar texto completoLeister, Karen J. Using minimal spanning trees to compare the reliabilty of network topologies. [Washington, DC]: National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Division, 1990.
Buscar texto completoDrmota, Michael. Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities. Basel: Birkhäuser Basel, 2004.
Buscar texto completoGrantham, S. B. Galvin's "racing pawns" game and a well-ordering of trees. Providence, R.I., USA: American Mathematical Society, 1985.
Buscar texto completoReinefeld, Alexander. Spielbaum-Suchverfahren. Berlin: Springer, 1989.
Buscar texto completoC, Alperin Roger y Workshop on Arboreal Group Theory (1988 : Mathematical Sciences Research Institute), eds. Arboreal group theory: Proceedings of a workshop held September 13-16, 1988. New York: Springer-Verlag, 1991.
Buscar texto completoservice), SpringerLink (Online, ed. Average Time Complexity of Decision Trees. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.
Buscar texto completoMahmoud, Hosam M. Evolution of random search trees. New York: Wiley, 1992.
Buscar texto completoRokach, Lior. Data mining with decision trees: Theroy and applications. Singapore: World Scientific, 2008.
Buscar texto completoTree structured function estimation with Haar wavelets. Hamburg: Verlag Dr. Kovač, 1999.
Buscar texto completoAdam, Korányi y Cartwright Donald I. 1949-, eds. Harmonic functions on trees and buildings: Workshop on Harmonic Functions on Graphs, October 30-November 3, 1995, City University of New York. Providence, R.I: American Mathematical Society, 1997.
Buscar texto completoMahar, David J. Fault tree analysis application guide. Rome, NY (P.O. Box 4700, Rome, 13440-8200): The Center, 1990.
Buscar texto completoSchneeweiss, Winfrid G. The fault tree method: From the fields of reliability and safety technology. Hagen, Germany: LiLoLe-Verlag, 1999.
Buscar texto completoValiente, Gabriel. Algorithms on Trees and Graphs. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002.
Buscar texto completoScheffler, Petra. Die Baumweite von Graphen als ein Mass für die Kompliziertheit algorithmischer Probleme. Berlin: Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik, 1989.
Buscar texto completoIrniger, Christophe-André Mario. Graph matching: Filtering databases of graphs using machine learning techniques. Berlin: AKA, 2005.
Buscar texto completoJoe Celko's Trees and hierarchies in SQL for smarties. 2a ed. Amsterdam: Elsevier/Morgan Kaufmann, 2012.
Buscar texto completoH, Kirchner, ed. Trees in algebra and programming - CAAP '96: 21st international colloquium, Linköping, Sweden, April 22-24, 1996 : proceedings. Berlin: Springer, 1996.
Buscar texto completo-C, Raoult J., ed. CAAP '92: 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, proceedings. Berlin: Springer-Verlag, 1992.
Buscar texto completoRandom trees: An interplay between combinatorics and probability. New York: Springer, 2009.
Buscar texto completo1957-, Steger Tim, ed. Harmonic analysis for anisotropic random walks on homogeneous trees. Providence, R.I: American Mathematical Society, 1994.
Buscar texto completoJoe Celko's Trees and hierarchies in SQL for smarties. Amsterdam: Morgan Kaufmann, 2004.
Buscar texto completoSimplicial complexes of graphs. Berlin: Springer, 2008.
Buscar texto completoIndian Institute of Management, Ahmedabad., ed. Solving medium to large sized euclidean generalized minimum spanning tree problems. Ahmedabad: Indian Institute of Management, 2003.
Buscar texto completoSerre, Jean-Pierre. Trees. Springer, 2012.
Buscar texto completoSerre, Jean-Pierre y J. Stilwell. Trees. Springer London, Limited, 2013.
Buscar texto completoAlgorithms on Trees and Graphs. Springer, 2002.
Buscar texto completoWu, Bang Ye y Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.
Buscar texto completoWu, Bang Ye y Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.
Buscar texto completoWu, Bang Ye y Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.
Buscar texto completoWu, Bang Ye y Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.
Buscar texto completoTeam, MT365 Course. Graphs, Networks and Design (Course MT365). Open University Worldwide, 1995.
Buscar texto completoGraphs, Networks and Design (Course MT365). Open University Worldwide, 1995.
Buscar texto completo