Libri sul tema "Trees (graph theory)"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 libri per l'attività di ricerca sul tema "Trees (graph theory)".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi i libri di molte aree scientifiche e compila una bibliografia corretta.
1960-, Chauvin Brigitte, Cohen Serge 1964-, Rouault Alain 1949- e Workshop on Trees (1995 : Versailles, France), a cura di. Trees: Workshop in Versailles, June 14-16, 1995. Basel: Birkhäuser, 1996.
Cerca il testo completoLimnios, N. Fault trees. London, UK: ISTE, 2007.
Cerca il testo completoIntroduction to [lambda]-trees. Singapore: World Scientific, 2001.
Cerca il testo completoA, Evstigneev V., a cura di. Graph theory for programmers: Algorithms for processing trees. Dordrecht: Kluwer Academic, 2000.
Cerca il testo completoCrouch, Peter. Trees, bialgebras and intrinsic numerical algorithms. Chicago, IL: Dept. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 1990.
Cerca il testo completoDingzhu, Du, Smith J. M e Rubinstein J. H, a cura di. Advances in Steiner trees. Dordrecht: Kluwer Academic, 2000.
Cerca il testo completoRubin, Matatyahu. The reconstruction of trees from their automorphism groups. Providence, R.I: American Mathematical Society, 1993.
Cerca il testo completoKloks, Ton. Treewidth: Computations and approximations. Berlin: Springer-Verlag, 1994.
Cerca il testo completoKasʹi͡anov, V. N. Graph theory for programmers: Algorithms for processing trees. Dordrecht: Kluwer Academic, 2000.
Cerca il testo completoLeister, Karen J. Using minimal spanning trees to compare the reliability of network topologies. Hampton, Va: Langley Research Center, 1990.
Cerca il testo 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.
Cerca il testo 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.
Cerca il testo completoN, Kasʹi͡a︡nov V., e Kotov Vadim Evgenʹevich, a cura di. Algoritmy obrabotki derevʹev. Novosibirsk: Akademii͡a︡ nauk SSSR, Sibirskoe otd-nie, Vychislitelʹnyĭ t͡s︡entr, 1990.
Cerca il testo completoN, Kasʹi͡a︡nov V., a cura di. Algoritmy na derevʹi͡a︡kh. Novosibirsk: Akademii͡a︡ nauk SSSR, Sibirskoe otd-nie, Vychislitelʹnyĭ t͡s︡entr, 1989.
Cerca il testo completoN, Kasʹi͡a︡nov V., e Kotov Vadim Evgenʹevich, a cura di. Teorii͡a︡ grafov: Algoritmy obrabotki derevʹev. Novosibirsk: VO "Nauka", 1994.
Cerca il testo completoIndian Institute of Management, Ahemdabad., a cura di. A probabilistic tabu search algorithm for the generalized minimum spanning tree problem. Ahmedabad: Indian Institute of Management, 2003.
Cerca il testo completoBarthélemy, Jean-Pierre. Trees and proximity representations. Chichester: Wiley, 1991.
Cerca il testo completoF, Le Gall J., a cura di. Random trees, Lévy processes, and spatial branching processes. Paris, France: Société mathématique de France, 2002.
Cerca il testo 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.
Cerca il testo completoDrmota, Michael. Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities. Basel: Birkhäuser Basel, 2004.
Cerca il testo completoGrantham, S. B. Galvin's "racing pawns" game and a well-ordering of trees. Providence, R.I., USA: American Mathematical Society, 1985.
Cerca il testo completoReinefeld, Alexander. Spielbaum-Suchverfahren. Berlin: Springer, 1989.
Cerca il testo completoC, Alperin Roger, e Workshop on Arboreal Group Theory (1988 : Mathematical Sciences Research Institute), a cura di. Arboreal group theory: Proceedings of a workshop held September 13-16, 1988. New York: Springer-Verlag, 1991.
Cerca il testo completoservice), SpringerLink (Online, a cura di. Average Time Complexity of Decision Trees. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.
Cerca il testo completoMahmoud, Hosam M. Evolution of random search trees. New York: Wiley, 1992.
Cerca il testo completoRokach, Lior. Data mining with decision trees: Theroy and applications. Singapore: World Scientific, 2008.
Cerca il testo completoTree structured function estimation with Haar wavelets. Hamburg: Verlag Dr. Kovač, 1999.
Cerca il testo completoAdam, Korányi, e Cartwright Donald I. 1949-, a cura di. 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.
Cerca il testo completoMahar, David J. Fault tree analysis application guide. Rome, NY (P.O. Box 4700, Rome, 13440-8200): The Center, 1990.
Cerca il testo completoSchneeweiss, Winfrid G. The fault tree method: From the fields of reliability and safety technology. Hagen, Germany: LiLoLe-Verlag, 1999.
Cerca il testo completoValiente, Gabriel. Algorithms on Trees and Graphs. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002.
Cerca il testo 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.
Cerca il testo completoIrniger, Christophe-André Mario. Graph matching: Filtering databases of graphs using machine learning techniques. Berlin: AKA, 2005.
Cerca il testo completoJoe Celko's Trees and hierarchies in SQL for smarties. 2a ed. Amsterdam: Elsevier/Morgan Kaufmann, 2012.
Cerca il testo completoH, Kirchner, a cura di. Trees in algebra and programming - CAAP '96: 21st international colloquium, Linköping, Sweden, April 22-24, 1996 : proceedings. Berlin: Springer, 1996.
Cerca il testo completo-C, Raoult J., a cura di. CAAP '92: 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, proceedings. Berlin: Springer-Verlag, 1992.
Cerca il testo completoRandom trees: An interplay between combinatorics and probability. New York: Springer, 2009.
Cerca il testo completo1957-, Steger Tim, a cura di. Harmonic analysis for anisotropic random walks on homogeneous trees. Providence, R.I: American Mathematical Society, 1994.
Cerca il testo completoJoe Celko's Trees and hierarchies in SQL for smarties. Amsterdam: Morgan Kaufmann, 2004.
Cerca il testo completoSimplicial complexes of graphs. Berlin: Springer, 2008.
Cerca il testo completoIndian Institute of Management, Ahmedabad., a cura di. Solving medium to large sized euclidean generalized minimum spanning tree problems. Ahmedabad: Indian Institute of Management, 2003.
Cerca il testo completoSerre, Jean-Pierre. Trees. Springer, 2012.
Cerca il testo completoSerre, Jean-Pierre, e J. Stilwell. Trees. Springer London, Limited, 2013.
Cerca il testo completoAlgorithms on Trees and Graphs. Springer, 2002.
Cerca il testo completoWu, Bang Ye, e Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.
Cerca il testo completoWu, Bang Ye, e Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.
Cerca il testo completoWu, Bang Ye, e Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.
Cerca il testo completoWu, Bang Ye, e Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.
Cerca il testo completoTeam, MT365 Course. Graphs, Networks and Design (Course MT365). Open University Worldwide, 1995.
Cerca il testo completoGraphs, Networks and Design (Course MT365). Open University Worldwide, 1995.
Cerca il testo completo