Libros sobre el tema "Graph"

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Graph.

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores mejores libros para su investigación sobre el tema "Graph".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore libros sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

Golumbic, M. C. Algorithmic graph theory and perfect graphs. 2a ed. Amsterdam: North Holland, 2004.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Bollobás, Béla. Random graphs. London: Academic Press, 1985.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Kolchin, V. F. Random graphs. Cambridge, UK: Cambridge University Press, 1999.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Random graphs. 2a ed. Cambridge: Cambridge University Press, 2001.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Random geometric graphs. Oxford: Oxford University Press, 2003.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Graph it: Reading charts and graphs. New York: PowerKids Press, 2015.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Graph attack!: Understanding charts and graphs. Englewood Cliffs, NJ: Cambridge Adult Education, 1993.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Bader, David, Henning Meyerhenke, Peter Sanders y Dorothea Wagner, eds. Graph Partitioning and Graph Clustering. Providence, Rhode Island: American Mathematical Society, 2013. http://dx.doi.org/10.1090/conm/588.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
11

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
12

Kyōto Daigaku. Sūri Kaiseki Kenkyūjo., ed. Graph equation for line graphs and m-step graphs. Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University, 2007.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
13

Reinschke, K. J. Multivariable control: A graph-theoretic approach. Berlin: Springer-Verlag, 1988.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
14

Reinschke, K. J. Multivariable Control: A graph-theoretic approach. Berlin: Akademie-Verlag, 1988.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
15

1949-, Hahn Geňa y Sabidussi Gert, eds. Graph symmetry: Algebraic methods and applications. Dordrecht: Kluwer Academic Publishers, 1997.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
16

Introduction to graph theory. 2a ed. Upper Saddle River, N.J: Prentice Hall, 2001.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
17

West, Douglas Brent. Introduction to graph theory. Upper Saddle River, NJ: Prentice Hall, 1996.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
18

Large networks and graph limits. Providence, Rhode Island: American Mathematical Society, 2012.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
19

J, Sheehan, ed. The Petersen graph. Cambridge [England]: Cambridge University Press, 1993.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
20

Chartrand, Gary. Chromatic graph theory. Boca Raton: Chapman & Hall/CRC, 2009.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
21

O'Connell, Neil. Some large deviation results for sparse random graphs. Bristol [England]: Hewlett Packard, 1996.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
22

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
23

Durrett, Rick. Random Graph Dynamics. Cambridge University Press, 2006.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
24

Durrett, Rick. Random Graph Dynamics. Cambridge University Press, 2007.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
25

Durrett, Rick. Random Graph Dynamics. Cambridge University Press, 2007.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
26

Durrett, Rick. Random Graph Dynamics. Cambridge University Press, 2009.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
27

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
28

Graph It! Making Line Graphs. Gareth Stevens Publishing, 2015.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
29

Coolen, A. C. C., A. Annibale y E. S. Roberts. Soft constraints: exponential random graph models. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0004.

Texto completo
Resumen
Exponential random graph models (ERGMs) provide conceptually elegant recipes for generating soft-constrained random graphs. This chapter begins by explaining the theory and describing how to properly specify an ERGM, including demonstrating Lagrange’s method to derive the values of the model parameters that correspond to the desired constraints. Three ERGMs, all with constraints depending linearly on the adjacency matrix, are solved exactly: the targeted total number of links, targeted individual node degrees and targeted number of two-way links in a directed graph. However, when the controlled features become more complicated, ERGMs have a tendency to produce graphs in extreme phases (very dense or very sparse). The two-star model and the Strauss model are worked through in detail using advanced techniques from statistical mechanics in order to analyze the phase transitions. The chapter closes with a discussion of the strengths and weaknesses of ERGMs as null models.
Los estilos APA, Harvard, Vancouver, ISO, etc.
30

Kolchin, V. F. Random Graphs. Cambridge University Press, 2010.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
31

Kolchin, V. F. Random Graphs. Cambridge University Press, 2009.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
32

Penrose, Mathew. Random Geometric Graphs. Oxford University Press, Incorporated, 2003.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
33

Sobieczky, Florian. Unimodularity in Randomly Generated Graphs. American Mathematical Society, 2018.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
34

Choi, In-kyeong. On straight line representations of random planar graphs. 1991.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
35

Kolchin, V. F. Random Graphs. Cambridge University Press, 2011.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
36

Graphs, Math. Math Graph: Graph Paper. Independently Published, 2018.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
37

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
38

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
39

Warner, Jack. Graph Attack: Understanding Charts and Graphs. Prentice Hall, 1992.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
40

Gosman, Gillian. Graph It: Reading Charts and Graphs. Rosen Publishing Group, 2014.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
41

NA. Precalculus Functn & Graphs& Graph Calc Pkg. Addison Wesley Publishing Company, 2004.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
42

Warner, Jack. Graph Attack: Understanding Charts and Graphs. Prentice Hall, 1992.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
43

Designs, Plan B. Graph Paper: Graph Paper 4x4. Independently Published, 2018.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
44

Pie, Sweetie. Graph Paper: Valves Graph Paper. Playful Publishing LLC, 2022.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
45

SANGWONGVANICH, Prathed. Graph Notebooke: Graph Paper Hexagonal. Independently Published, 2019.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
46

Publishing, Mmlt. Graph Path: Graph Paper Notebook. Independently Published, 2020.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
47

Jay, Mary. Graph Paper Composition: Graph Paper. Independently Published, 2019.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
48

GB, Zack. Graph Paper: Graph Composition Book. Independently Published, 2019.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
49

Graph Book: 8x8 Graph Paper. Independently Published, 2021.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
50

MICHAEL, John. Graph Paper Composition: Graph Book. Independently Published, 2019.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía