Conecte-se

Bibliografias temáticas / Graph algorithmic / Livros

Livros sobre o tema "Graph algorithmic"

Siga este link para ver outros tipos de publicações sobre o tema: Graph algorithmic.

Autor: Grafiati

Publicado: 25 de maio de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores livros para estudos sobre o assunto "Graph algorithmic".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja os livros das mais diversas áreas científicas e compile uma bibliografia correta.

1

Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. 2^a ed. Amsterdam: North Holland, 2004.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Algorithmic graph theory. London: Prentice-Hall, 1990.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Algorithmic graph theory. Cambridge [Cambridgeshire]: Cambridge University Press, 1985.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

McHugh, James A. Algorithmic graph theory. Englewood Cliffs, N.J: Prentice Hall, 1990.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. Amsterdam: Elsevier, 2004.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Nagamochi, Hiroshi. Algorithmic aspects of graph connectivity. New York: Cambridge University Press, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Toshihide, Ibaraki, ed. Algorithmic aspects of graph connectivity. New York: Cambridge University Press, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Chartrand, G. Applied and algorithmic graph theory. New York: McGraw-Hill, 1993.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Chartrand, G. Applied and algorithmic graph theory. London: McGraw-Hill, 1993.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Chartrand, Gary. Applied and algorithmic graph theory. New York: McGraw-Hill, 1993.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

An algorithmic theory of numbers, graphs, and convexity. Philadelphia, Pa: Society for Industrial and Applied Mathematics, 1986.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Algorithmic algebraic combinatorics and Gröbner bases. Heidelberg: Springer, 2009.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

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

Texto completo da fonte

Resumo:

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 for undergraduate and graduate programs, studying information technology, for in-depth training in analysis and design of systems of complex structure. Also the guide can be useful to specialists of the IT sphere in the study of algorithmic aspects of graph theory.

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Giuseppe, Di Battista, ed. Graph drawing: Algorithms for the visualization of graphs. Upper Saddle River, N.J: Prentice Hall, 1999.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Even, Shimon. Graph algorithms. 2^a ed. Cambridge, NY: Cambridge University Press, 2011.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Minoux, Michel. Graphes, algorithmes, logiciels. [Paris]: Dunod, 1986.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Erciyes, K. Algebraic Graph Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87886-3.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

1960-, Tamassia Roberto, e Tollis Ioannis G. 1958-, eds. Graph algorithms and applications I. River Edge, N.J: World Scientific, 2002.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Algorithms on graphs. Blue Ridge Summit, PA: TAB Professional and Reference Books, 1989.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Bader, David A., 1969- editor of compilation, Meyerhenke, Henning, 1978- editor of compilation, Sanders, Peter, editor of compilation e 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. Providence, Rhode Island: American Mathematical Society, 2013.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Jungnickel, D. Graphs, networks, and algorithms. 3^a ed. Berlin: Springer, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Jungnickel, D. Graphs, networks, and algorithms. 3^a ed. Berlin: Springer, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Erciyes, K. Guide to Graph Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73235-0.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Reinhard, Klette, ed. Euclidean shortest paths: Exact or approximate algorithms. London: Springer-Verlag, 2011.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

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. Editado por Richter R. Bruce, American Mathematical Society, Institute of Mathematical Statistics e Society for Industrial and Applied Mathematics. Providence, R.I: American Mathematical Society, 1989.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Richter, R. Bruce, ed. Graphs and Algorithms. Providence, Rhode Island: American Mathematical Society, 1989. http://dx.doi.org/10.1090/conm/089.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Golumbic, Martin Charles, e Werner Rheinboldt. Algorithmic Graph Theory and Perfect Graphs. Elsevier Science & Technology Books, 2014.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Golumbic, Martin Charles. Algorithmic Graph Theory and Perfect Graphs. Elsevier Science & Technology Books, 2004.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Algorithmic Graph Theory and Perfect Graphs. Elsevier, 2004. http://dx.doi.org/10.1016/s0167-5060(04)x8001-8.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Wilson, Robin J., Martin Charles Golumbic e Lowell W. Beineke. Topics in Algorithmic Graph Theory. Cambridge University Press, 2021.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Ibaraki, Toshihide, e Hiroshi Nagamochi. Algorithmic Aspects of Graph Connectivity. Cambridge University Press, 2010.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Beineke, Lowell W., Martin Charles Golumbic e Robin J. Wilson, eds. Topics in Algorithmic Graph Theory. Cambridge University Press, 2021. http://dx.doi.org/10.1017/9781108592376.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Algorithmic Aspects of Graph Connectivity. Cambridge University Press, 2019.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Wilson, Robin J., Martin Charles Golumbic e Lowell W. Beineke. Topics in Algorithmic Graph Theory. University of Cambridge ESOL Examinations, 2021.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Wilson, Robin J., Martin Charles Golumbic e Lowell W. Beineke. Topics in Algorithmic Graph Theory. University of Cambridge ESOL Examinations, 2021.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Ibaraki, Toshihide, e Hiroshi Nagamochi. Algorithmic Aspects of Graph Connectivity. Cambridge University Press, 2011.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Jones, Gareth A., Mikhail Klin, Ilia Ponomarenko, Aleksandar Jurisic e Mikhail Muzychuk. Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer, 2014.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Lovasz, Laszlo. An Algorithmic Theory of Numbers, Graphs and Convexity (CBMS-NSF Regional Conference Series in Applied Mathematics). Society for Industrial Mathematics, 1987.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!