Filtrar la búsqueda

  • Libros (9)

  • Nuevo (9)

a

Intervalo de precios personalizado (EUR)

a

Gannous aiman (9 resultados)

Autor: 
Refinar con la Búsqueda avanzada
  • Idioma: Inglés

    Editorial: de Gruyter 2/16/2026, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de AmericaBargainBookStores

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 47,71

     Gastos de envío gratis 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 4 disponibles

    Paperback or Softback. Condición: New. Graph Theory: Connectivity, Software Engineering and Bioinformatics. Book.

  • Idioma: Inglés

    Editorial: De Gruyter, Berlin, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 55,41

     Gastos de envío gratis 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 1 disponible

    Paperback. Condición: new. Paperback. The authors passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

  • Idioma: Inglés

    Editorial: De Gruyter, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: California Books, Miami, FL, Estados Unidos de AmericaCalifornia Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 56,01

    Envío por EUR 2,67 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 9 disponibles

    Condición: New.

  • Idioma: Inglés

    Editorial: De Gruyter, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 66,93

    Envío por EUR 11,93 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    perfect. Condición: Brand New. 168 pages. 6.69x2.00x9.45 inches. In Stock.

  • Idioma: Inglés

    Editorial: De Gruyter, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: Russell Books, Victoria, BC, CanadaRussell Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 63,35

    Envío por EUR 17,82 
    Se envía de Canada a Estados Unidos de America

    Cantidad disponible: 9 disponibles

    perfect. Condición: New. Special order direct from the distributor.

  • Idioma: Inglés

    Editorial: De Gruyter, Berlin, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: CitiRetail, Stevenage, Reino UnidoCitiRetail

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 62,63

    Envío por EUR 44,13 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Paperback. Condición: new. Paperback. The authors passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

  • Idioma: Inglés

    Editorial: De Gruyter, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 76,59

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Taschenbuch. Condición: Neu. Neuware - The author's passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems.…

  • Idioma: Inglés

    Editorial: De Gruyter, Berlin, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 92,76

    Envío por EUR 32,98 
    Se envía de Australia a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Paperback. Condición: new. Paperback. The authors passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

  • Idioma: Inglés

    Editorial: De Gruyter, 2026

    3119143723 / 9783119143721

    • Tapa blanda

    Librería: preigu, Osnabrück, Alemaniapreigu

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 62,45

    Envío por EUR 70,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Taschenbuch. Condición: Neu. Graph Theory | Connectivity, Software Engineering and Bioinformatics | Aiman S. Gannous | Taschenbuch | Großformatiges Paperback. Klappenbroschur | XII | Englisch | 2026 | De Gruyter | EAN 9783119143721 | Verantwortliche Person für die EU: Walter de Gruyter GmbH, De Gruyter GmbH, Genthiner Str. 13, 10785 Berlin, productsafety[at]degruyterbrill[dot]com | Anbieter: preigu.…