Libros sobre el tema "Graph algorithmic"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores mejores libros para su investigación sobre el tema "Graph algorithmic".
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.
Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. 2a ed. Amsterdam: North Holland, 2004.
Buscar texto completoAlgorithmic graph theory. London: Prentice-Hall, 1990.
Buscar texto completoAlgorithmic graph theory. Cambridge [Cambridgeshire]: Cambridge University Press, 1985.
Buscar texto completoMcHugh, James A. Algorithmic graph theory. Englewood Cliffs, N.J: Prentice Hall, 1990.
Buscar texto completoGolumbic, Martin Charles. Algorithmic graph theory and perfect graphs. Amsterdam: Elsevier, 2004.
Buscar texto completoNagamochi, Hiroshi. Algorithmic aspects of graph connectivity. New York: Cambridge University Press, 2008.
Buscar texto completoToshihide, Ibaraki, ed. Algorithmic aspects of graph connectivity. New York: Cambridge University Press, 2008.
Buscar texto completoChartrand, G. Applied and algorithmic graph theory. New York: McGraw-Hill, 1993.
Buscar texto completoChartrand, G. Applied and algorithmic graph theory. London: McGraw-Hill, 1993.
Buscar texto completoChartrand, Gary. Applied and algorithmic graph theory. New York: McGraw-Hill, 1993.
Buscar texto completoAn algorithmic theory of numbers, graphs, and convexity. Philadelphia, Pa: Society for Industrial and Applied Mathematics, 1986.
Buscar texto completoAlgorithmic algebraic combinatorics and Gröbner bases. Heidelberg: Springer, 2009.
Buscar texto completoGdanskiy, Nikolay. Fundamentals of the theory and algorithms on graphs. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/978686.
Texto completoEvstigneev, V. A. Teorii͡a︡ grafov: Algoritmy obrabotki beskonturnykh grafov. Novosibirsk: "Nauka," Sibirskoe predprii͡a︡tie RAN, 1998.
Buscar texto completoGiuseppe, Di Battista, ed. Graph drawing: Algorithms for the visualization of graphs. Upper Saddle River, N.J: Prentice Hall, 1999.
Buscar texto completoEven, Shimon. Graph algorithms. 2a ed. Cambridge, NY: Cambridge University Press, 2011.
Buscar texto completoBonato, Anthony. The game of cops and robbers on graphs. Providence, R.I: American Mathematical Society, 2011.
Buscar texto completoMinoux, Michel. Graphes, algorithmes, logiciels. [Paris]: Dunod, 1986.
Buscar texto completo1957-, Gutin Gregory, ed. Digraphs: Theory, algorithms, and applications. 2a ed. London: Springer, 2009.
Buscar texto completo1957-, Gutin Gregory, ed. Digraphs: Theory, algorithms, and applications. London: Springer, 2001.
Buscar texto completoErciyes, K. Algebraic Graph Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87886-3.
Texto completo1960-, Tamassia Roberto y Tollis Ioannis G. 1958-, eds. Graph algorithms and applications I. River Edge, N.J: World Scientific, 2002.
Buscar texto completoAlgorithms on graphs. Blue Ridge Summit, PA: TAB Professional and Reference Books, 1989.
Buscar texto completoBader, David A., 1969- editor of compilation, Meyerhenke, Henning, 1978- editor of compilation, Sanders, Peter, editor of compilation y 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.
Buscar texto completoHartmut, Noltemeier, ed. Graphentheoretische Konzepte und Algorithmen. 2a ed. Wiesbaden: Vieweg+Teubner Verlag / GWV Fachverlage GmbH, Wiesbaden, 2009.
Buscar texto completoNishizeki, T. Planar graphs: Theory and algorithms. Amsterdam: North-Holland, 1988.
Buscar texto completoN, Chiba, ed. Planar graphs: Theory and algorithms. Mineola, N.Y: Dover Publications, 2008.
Buscar texto completoJungnickel, D. Graphs, networks, and algorithms. 3a ed. Berlin: Springer, 2008.
Buscar texto completoJungnickel, D. Graphs, networks, and algorithms. 3a ed. Berlin: Springer, 2008.
Buscar texto completoJungnickel, D. Graphs, networks, and algorithms. Berlin: Springer, 1999.
Buscar texto completoErciyes, K. Guide to Graph Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73235-0.
Texto completoReinhard, Klette, ed. Euclidean shortest paths: Exact or approximate algorithms. London: Springer-Verlag, 2011.
Buscar texto completoS, Swamy M. N., ed. Graphs: Theory and algorithms. New York: Wiley, 1992.
Buscar texto completoAMS-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 y Society for Industrial and Applied Mathematics. Providence, R.I: American Mathematical Society, 1989.
Buscar texto completoCrouch, Peter. Trees, bialgebras and intrinsic numerical algorithms. Chicago, IL: Dept. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 1990.
Buscar texto completoRichter, R. Bruce, ed. Graphs and Algorithms. Providence, Rhode Island: American Mathematical Society, 1989. http://dx.doi.org/10.1090/conm/089.
Texto completoKučera, Luděk. Combinatorial algorithms. Bristol: Institute of Physics, 1989.
Buscar texto completoFaulon, Jean-Loup. Handbook of chemoinformatics algorithms. Boca Raton: Chapman & Hall/CRC, 2010.
Buscar texto completoGolumbic, Martin Charles y Werner Rheinboldt. Algorithmic Graph Theory and Perfect Graphs. Elsevier Science & Technology Books, 2014.
Buscar texto completoGolumbic, Martin Charles. Algorithmic Graph Theory and Perfect Graphs. Elsevier Science & Technology Books, 2004.
Buscar texto completoAlgorithmic Graph Theory and Perfect Graphs. Elsevier, 2004. http://dx.doi.org/10.1016/s0167-5060(04)x8001-8.
Texto completoWilson, Robin J., Martin Charles Golumbic y Lowell W. Beineke. Topics in Algorithmic Graph Theory. Cambridge University Press, 2021.
Buscar texto completoIbaraki, Toshihide y Hiroshi Nagamochi. Algorithmic Aspects of Graph Connectivity. Cambridge University Press, 2010.
Buscar texto completoBeineke, Lowell W., Martin Charles Golumbic y Robin J. Wilson, eds. Topics in Algorithmic Graph Theory. Cambridge University Press, 2021. http://dx.doi.org/10.1017/9781108592376.
Texto completoAlgorithmic Aspects of Graph Connectivity. Cambridge University Press, 2019.
Buscar texto completoWilson, Robin J., Martin Charles Golumbic y Lowell W. Beineke. Topics in Algorithmic Graph Theory. University of Cambridge ESOL Examinations, 2021.
Buscar texto completoWilson, Robin J., Martin Charles Golumbic y Lowell W. Beineke. Topics in Algorithmic Graph Theory. University of Cambridge ESOL Examinations, 2021.
Buscar texto completoIbaraki, Toshihide y Hiroshi Nagamochi. Algorithmic Aspects of Graph Connectivity. Cambridge University Press, 2011.
Buscar texto completoJones, Gareth A., Mikhail Klin, Ilia Ponomarenko, Aleksandar Jurisic y Mikhail Muzychuk. Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer, 2014.
Buscar texto completoLovasz, Laszlo. An Algorithmic Theory of Numbers, Graphs and Convexity (CBMS-NSF Regional Conference Series in Applied Mathematics). Society for Industrial Mathematics, 1987.
Buscar texto completo