Log in

Relevant bibliographies by topics / Algorithms. Graph theory / Books

To see the other types of publications on this topic, follow the link: Algorithms. Graph theory.

Books on the topic 'Algorithms. Graph theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 16 February 2022

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

Algorithmic graph theory. Cambridge University Press, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Golumbic, Martin Charles, and Irith Ben-Arroyo Hartman, eds. Graph Theory, Combinatorics and Algorithms. Springer-Verlag, 2005. http://dx.doi.org/10.1007/b106672.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

International Conference on the Theory and Applications of Graphs (7th 1992 Western Michigan University). Graph theory, combinatorics, and algorithms. Wiley, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

S, Swamy M. N., ed. Graphs: Theory and algorithms. Wiley, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Nishizeki, T. Planar graphs: Theory and algorithms. North-Holland, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

N, Chiba, ed. Planar graphs: Theory and algorithms. Dover Publications, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Agnarsson, Geir. Graph theory: Modeling, applications, and algorithms. Pearson/Prentice Hall, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Algorithms on graphs. TAB Professional and Reference Books, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

1957-, Gutin Gregory, ed. Digraphs: Theory, algorithms, and applications. 2nd ed. Springer, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

1957-, Gutin Gregory, ed. Digraphs: Theory, algorithms, and applications. Springer, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

11

Mole, R. H. BASIC graph and network algorithms. Butterworths, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

Jungnickel, D. Graphs, networks, and algorithms. Springer, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

Jungnickel, D. Graphs, networks, and algorithms. 3rd ed. Springer, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

14

Jungnickel, D. Graphs, networks, and algorithms. 3rd ed. Springer, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

15

Holloway, Nick. Parallel algorithms in graph theory and algebra. typescript, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

Saha Ray, Santanu. Graph Theory with Algorithms and its Applications. Springer India, 2013. http://dx.doi.org/10.1007/978-81-322-0750-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Karpiński, Marek. Fast parallel algorithms for graph matching problems. Clarendon Press, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

18

Evstigneev, V. A. Teorii͡a︡ grafov: Algoritmy obrabotki beskonturnykh grafov. "Nauka," Sibirskoe predprii͡a︡tie RAN, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

19

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

20

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

21

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

22

Faulon, Jean-Loup. Handbook of chemoinformatics algorithms. Chapman & Hall/CRC, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

23

Gdanskiy, Nikolay. Fundamentals of the theory and algorithms on graphs. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/978686.

Full text

Abstract:

The textbook describes the main theoretical principles of graph theory, the main tasks to be solved using graph structures, and General methods of their solution and specific algorithms, with estimates of their complexity. I covered a lot of the examples given questions to test knowledge and tasks for independent decisions. Along with the control tasks to verify the theoretical training provided practical assignments to develop programs to study topics of graph theory. Meets the requirements of Federal state educational standards of higher education of the last generation. Designed

APA, Harvard, Vancouver, ISO, and other styles

24

Kučera, Luděk. Combinatorial algorithms. Institute of Physics, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kučera, Luděk. Combinatorial algorithms. Adam Hilger, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

26

Combinatorial algorithms. Adam Hilger, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

27

Theory and Applications of Graphs with Special Emphasis on Algorithms and Computer Science Applications (Conference) (5th 1984 Western Michigan University). Graph theory with applications to algorithms and computer science. Wiley, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

28

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

N, Kasʹi͡a︡nov V., та Kotov Vadim Evgenʹevich, ред. Algoritmy obrabotki derevʹev. Akademii͡a︡ nauk SSSR, Sibirskoe otd-nie, Vychislitelʹnyĭ t͡s︡entr, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

30

Michel, Minoux, ed. Graphs, dioids and semirings: New models and algorithms. Springer, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

31

Hartmut, Noltemeier, ed. Graphentheoretische Konzepte und Algorithmen. 2nd ed. Vieweg+Teubner Verlag / GWV Fachverlage GmbH, Wiesbaden, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

32

Planar graph drawing. World Scientific, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

33

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

34

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

35

N, Kasʹi͡a︡nov V., та Kotov Vadim Evgenʹevich, ред. Teorii͡a︡ grafov: Algoritmy obrabotki derevʹev. VO "Nauka", 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

36

R, Evans James. Optimization algorithms for networks and graphs. 2nd ed. M. Dekker, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

37

International Conference on the Theory and Applications of Graphs (7th 1992 Western Michigan University). Graph theory, combinatorics, and algorithms: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs. Wiley, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

38

Bader, David A., 1969- editor of compilation, Meyerhenke, Henning, 1978- editor of compilation, Sanders, Peter, editor of compilation, and Wagner, Dorothea, 1957- editor of compilation, eds. Graph partitioning and graph clustering: 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA. American Mathematical Society, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

39

Bonato, Anthony. The game of cops and robbers on graphs. American Mathematical Society, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

40

The linear ordering problem: Algorithms and applications. Heldermann, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

41

Evstigneev, V. A. Svodimye grafy i graf-modeli v programmirovanii. Izd-vo In-ta diskretnoĭ matematiki i informatiki, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

42

Jungnickel, Dieter. Graphs, Networks and Algorithms. 4th ed. Springer Berlin Heidelberg, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

AMS-IMS-SIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms (1987 University of Colorado). Graphs and algorithms: Proceedings of the AMS-IMS-SIAM joint summer research conference held June 28-July 4, 1987 with support from the National Science Foundation. Edited by Richter R. Bruce, American Mathematical Society, Institute of Mathematical Statistics, and Society for Industrial and Applied Mathematics. American Mathematical Society, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

44

Ray, Santanu Saha. Graph Theory with Algorithms and its Applications: In Applied Science and Technology. Springer India, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

45

Vincent, Bouchitté, and Morvan Michel, eds. Orders, algorithms, and applications: International Workshop ORDAL '94, Lyon, France, July 1994 : proceedings. Springer-Verlag, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

46

Ernst, Mayr, Schmidt Günther 1939-, and Tinhofer Gottfried, eds. Graph-theoretic concepts in computer science: 20th International Workshop WG '94, Herrsching, Germany, June 16-18, 1994 : proceedings. Springer-Verlag, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

47

International Workshop WG (22nd 1996 Cadenabbia, Italy). Graph-theoretic concepts in computer science: 22nd International Workshop WG '96, Cadenabbia, Italy, June 12-14, 1996 : proceedings. Springer-Verlag, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

48

I, Nechepurenko M., and Akademii͡a nauk SSSR. Sibirskoe otdelenie. Vychislitelʹnyĭ t͡sentr., eds. Metody i programmy reshenii͡a optimizat͡sionnykh zadach na grafakh i seti͡akh: Tezisy dokladov IV vsesoi͡uznogo soveshchanii͡a, 17-19 okti͡abri͡a 1989 g. Akademii͡a nauk, Sibirskoe otd-nie, Vychislitelʹnyĭ t͡sentr, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

49

Saparov, M. S. Rekurrentnye teoretiko-grafovye funkt͡s︡ii i algoritmy ikh vychislenii͡a︡. Ylym, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

50

Smarandache, Florentin, and Said Broumi. Neutrosophic Graph Theory and Algorithms. IGI Global, 2019.

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!