Name: applications of graph theory (en Inglés)
Price: 25150.00 CLP
Availability: InStock
Author: Pirzada, Shariefuddin ; Dharwadker, Ashay
ISBN: 9781466397095

portada applications of graph theory (en Inglés)

Formato

Libro Físico

Autor

Ashay Dharwadker

Shariefuddin Pirzada

Editorial

Createspace Independent Publishing Platform

Año

2011

Idioma

Inglés

N° páginas

Encuadernación

Tapa Blanda

Dimensiones

28.0 x 21.6 x 0.2 cm

Peso

0.10 kg.

ISBN

1466397098

ISBN13

9781466397095

Categorías

Matemáticas aplicadas

applications of graph theory (en Inglés)

Ashay Dharwadker (Autor) · Shariefuddin Pirzada (Autor) · Createspace Independent Publishing Platform · Tapa Blanda

Libro Nuevo

$ 25.150

$ 34.930

Ahorras: $ 9.780

28% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Lunes 20 de Mayo y el Miércoles 29 de Mayo.

Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.

Reseña del libro "applications of graph theory (en Inglés)"

Graph theory is becoming increasingly significant as it is applied to other areas of mathematics, science and technology. It is being actively used in fields as varied as biochemistry (genomics), electrical engineering (communication networks and coding theory), computer science (algorithms and computation) and operations research (scheduling). The powerful combinatorial methods found in graph theory have also been used to prove fundamental results in other areas of pure mathematics. This book, besides giving a general outlook of these facts, includes new graph theoretical proofs of Fermat's Little Theorem and the Nielson-Schreier Theorem. New applications to DNA sequencing (the SNP assembly problem) and computer network security (worm propagation) using minimum vertex covers in graphs are discussed. We also show how to apply edge coloring and matching in graphs for scheduling (the timetabling problem) and vertex coloring in graphs for map coloring and the assignment of frequencies in GSM mobile phone networks. Finally, we revisit the classical problem of finding re-entrant knight's tours on a chessboard using Hamiltonian circuits in graphs.