Log in

Relevant bibliographies by topics / Trees (graph theory) / Books

To see the other types of publications on this topic, follow the link: Trees (graph theory).

Books on the topic 'Trees (graph theory)'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 books for your research on the topic 'Trees (graph theory).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

1960-, Chauvin Brigitte, Cohen Serge 1964-, Rouault Alain 1949-, and Workshop on Trees (1995 : Versailles, France), eds. Trees: Workshop in Versailles, June 14-16, 1995. Basel: Birkhäuser, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dingzhu, Du, Smith J. M, and Rubinstein J. H, eds. Advances in Steiner trees. Dordrecht: Kluwer Academic, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

11

Scheffler, Petra. Linear-time algorithms for NP-complete problems restricted to partial k-trees. Berlin: Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

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.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

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ʹnyĭ t͡s︡entr, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

14

N, Kasʹi͡a︡nov V., ed. Algoritmy na derevʹi͡a︡kh. Novosibirsk: Akademii͡a︡ nauk SSSR, Sibirskoe otd-nie, Vychislitelʹnyĭ t͡s︡entr, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

17

Barthélemy, Jean-Pierre. Trees and proximity representations. Chichester: Wiley, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

18

F, Le Gall J., ed. Random trees, Lévy processes, and spatial branching processes. Paris, France: Société mathématique de France, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

19

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.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

20

Drmota, Michael. Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities. Basel: Birkhäuser Basel, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

21

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

22

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

23

C, Alperin Roger, and 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.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

24

service), SpringerLink (Online, ed. Average Time Complexity of Decision Trees. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

25

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

26

Z, Maimon Oded, ed. Data mining with decision trees: Theroy and applications. Singapore: World Scientific, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

27

Tree structured function estimation with Haar wavelets. Hamburg: Verlag Dr. Kovač, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

28

Adam, Korá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.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

30

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

31

Valiente, Gabriel. Algorithms on Trees and Graphs. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

32

Scheffler, Petra. Die Baumweite von Graphen als ein Mass für die Kompliziertheit algorithmischer Probleme. Berlin: Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

33

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

34

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

35

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

36

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

37

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

38

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

39

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

40

Simplicial complexes of graphs. Berlin: Springer, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

41

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

42

Serre, Jean-Pierre. Trees. Springer, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

Serre, Jean-Pierre. Trees. Springer London, Limited, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

44

Algorithms on Trees and Graphs. Springer, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

45

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

46

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

47

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

48

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

49

Team, MT365 Course. Graphs, Networks and Design (Course MT365). Open University Worldwide, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

50

Graphs, Networks and Design (Course MT365). Open University Worldwide, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!