Books on the topic 'Trees (Graph theory) Spanning trees (Graph theory)'

Leister, Karen J. Using minimal spanning trees to compare the reliability of network topologies. Hampton, Va: Langley Research Center, 1990.

Indian Institute of Management, Ahemdabad., ed. A probabilistic tabu search algorithm for the generalized minimum spanning tree problem. Ahmedabad: Indian Institute of Management, 2003.

Leister, 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.

Indian Institute of Management, Ahmedabad., ed. Solving medium to large sized euclidean generalized minimum spanning tree problems. Ahmedabad: Indian Institute of Management, 2003.

Limnios, N. Fault trees. London, UK: ISTE, 2007.

Kasʹi͡anov, V. N. Graph theory for programmers: Algorithms for processing trees. Dordrecht: Kluwer Academic, 2000.

A, Evstigneev V., ed. Graph theory for programmers: Algorithms for processing trees. Dordrecht: Kluwer Academic, 2000.

Introduction to [lambda]-trees. Singapore: World Scientific, 2001.

Crouch, Peter. Trees, bialgebras and intrinsic numerical algorithms. Chicago, IL: Dept. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 1990.

Rubin, Matatyahu. The reconstruction of trees from their automorphism groups. Providence, R.I: American Mathematical Society, 1993.

Scheffler, 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.

Classification and regression trees. New York, N.Y: Chapman & Hall, 1993.

N, 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.

N, Kasʹi͡a︡nov V., and Kotov Vadim Evgenʹevich, eds. Teorii͡a︡ grafov: Algoritmy obrabotki derevʹev. Novosibirsk: VO "Nauka", 1994.

N, Kasʹi͡a︡nov V., and Kotov Vadim Evgenʹevich, eds. Algoritmy obrabotki derevʹev. Novosibirsk: Akademii͡a︡ nauk SSSR, Sibirskoe otd-nie, Vychislitelʹnyĭ t͡s︡entr, 1990.

Hougen, 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.

Barthélemy, Jean-Pierre. Trees and proximity representations. Chichester: Wiley, 1991.

Treewidth: Computations and approximations. Berlin: Springer-Verlag, 1994.

Grantham, S. B. Galvin's "racing pawns" game and a well-ordering of trees. Providence, R.I., USA: American Mathematical Society, 1985.

F, Le Gall J., ed. Random trees, Lévy processes, and spatial branching processes. Paris, France: Société mathématique de France, 2002.

Reinefeld, Alexander. Spielbaum-Suchverfahren. Berlin: Springer, 1989.

Adam, Korányi, and 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.

Tree structured function estimation with Haar wavelets. Hamburg: Verlag Dr. Kovač, 1999.

Mahmoud, Hosam M. Evolution of random search trees. New York: Wiley, 1992.

Schneeweiss, Winfrid G. The fault tree method: From the fields of reliability and safety technology. Hagen, Germany: LiLoLe-Verlag, 1999.

Mahar, David J. Fault tree analysis application guide. Rome, NY (P.O. Box 4700, Rome, 13440-8200): The Center, 1990.

Scheffler, 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.

Simplicial complexes of graphs. Berlin: Springer, 2008.

Joe Celko's Trees and hierarchies in SQL for smarties. 2nd ed. Amsterdam: Elsevier/Morgan Kaufmann, 2012.

Random trees: An interplay between combinatorics and probability. New York: Springer, 2009.

-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.

1957-, Steger Tim, ed. Harmonic analysis for anisotropic random walks on homogeneous trees. Providence, R.I: American Mathematical Society, 1994.

The valuative tree. Berlin: Springer, 2004.

1960-, Chauvin Brigitte, ed. Mathematics and computer science II: Algorithms, trees, combinatorics and probabilities. Basel: Birkhauser Verlag, 2002.

Joe Celko's Trees and hierarchies in SQL for smarties. Amsterdam: Morgan Kaufmann, 2004.

Irniger, Christophe-André Mario. Graph matching: Filtering databases of graphs using machine learning techniques. Berlin: AKA, 2005.

Argyros, S. A classification of separable Rosenthal compacta and its applications. Warszawa: Institute of Mathematics, Polish Academy of Sciences, 2008.

Argyros, S. A classification of separable Rosenthal compacta and its applications. Warszawa: Institute of Mathematics, Polish Academy of Sciences, 2008.

H, Kirchner, ed. Trees in algebra and programming - CAAP '96: 21st international colloquium, Linköping, Sweden, April 22-24, 1996 : proceedings. Berlin: Springer, 1996.

CAAP, '96 (21st 1996 Linköping Sweden). Trees in algebra and programming--CAAP '96: 21st international colloquium, Linköping, Sweden, April 22-24, 1996, proceedings. Berlin: Springer, 1996.

P, Franchi-Zannettacci, ed. CAAP 86: 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986 : proceedings. Berlin: Springer-Verlag, 1986.

Colloquium on Trees in Algebra and Programming. (15th 1990 Copenhagen, Denmark). CAAP '90. Berlin: Springer-Verlag, 1990.

Medical conditions and massage therapy: A decision tree approach. Philadelphia: Wolters Kluwer/Lippincott Williams & Wilkins Health, 2010.

1945-, Arnold A., ed. CAAP '90: 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 1990, proceedings. Berlin: Springer-Verlag, 1990.

Ecole d'été de probabilités de Saint-Flour (35th : 2005), ed. Probability and real trees: École d'Été de Probabilités de Saint-Flour XXXV-2005. Berlin: Springer, 2008.

Jean, Bertoin, Martinelli F, Peres Y, Bernard P. 1944-, Bertoin Jean, Martinelli F, and Peres Y, eds. Lectures on probability theory and statistics: Ecole d'été de probabilités de Saint-Flour XXVII, 1997. Berlin: Springer, 2000.

Ecole d'été de probabilités de Saint-Flour (27th 1997). Lectures on probability theory and statistics: Ecole d'eté de probabilités de Saint-Flour XXVII, 1997. Edited by Bertoin Jean, Martinelli F, Peres Y, and Bernard P. 1944-. Berlin: Springer, 1999.

Colloquium on Trees in Algebra and Programming (13th 1988 Nancy, France). CAAP '88: 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988 : proceedings. Berlin: Springer-Verlag, 1988.

Benjamin, Arthur. Discrete mathematics. Chantilly, VA: The Teaching Company, 2009.

Yust, Jason. Graph Theory for Temporal Structure. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190696481.003.0014.