Cantitate/Preț
Produs
Total produse
Vezi coșul
Graph Theory and Its Applications de Jonathan L. Gross

Graph Theory and Its Applications: Textbooks in Mathematics

Autor Jonathan L. Gross, Jay Yellen, Mark Anderson
en Limba Engleză Hardback – 6 noi 2018
Graph Theory and its Applications, Third Edition is the latest edition of the bestselling textbook for undergraduate courses in graph theory, yet expansive enough to be used for graduate courses. It takes a comprehensive, accessible approach to graph theory that integrates classical developments with emerging methods, models, and practical needs.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 31625 lei  6-8 săpt. +9140 lei  5-11 zile
  CRC Press – 21 ian 2023 31625 lei  6-8 săpt. +9140 lei  5-11 zile
Hardback (1) 49682 lei  6-8 săpt. +15022 lei  5-11 zile
  CRC Press – 6 noi 2018 49682 lei  6-8 săpt. +15022 lei  5-11 zile

Din seria Textbooks in Mathematics

Preț: 49682 lei

Preț vechi: 65868 lei
-25% Nou

Puncte Express: 745
Preț estimativ în valută:
9507€ • 10040$ • 7911£

Carte tipărită la comandă

Livrare economică 13-27 ianuarie 25
Livrare express 07-13 decembrie pentru 16021 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781482249484
ISBN-10: 1482249480
Pagini: 592
Ilustrații: 10 Tables, black and white; 905 Illustrations, black and white
Dimensiuni: 178 x 254 x 35 mm
Greutate: 1.23 kg
Ediția:3 ed
Editura: CRC Press
Colecția CRC Press
Seria Textbooks in Mathematics

Locul publicării:Boca Raton, United States

Public țintă

Academic

Cuprins

Introduction to Graph Models
Graphs and Digraphs. Common Families of Graphs. Graph Modeling Applications. Walks and Distance. Paths, Cycles, and Trees. Vertex and Edge Attributes.
Structure and Representation
Graph Isomorphism. Automorphism and Symmetry. Subgraphs. Some Graph Operations. Tests for Non-Isomorphism. Matrix Representation. More Graph Operations.
Trees
Characterizations and Properties of Trees. Rooted Trees, Ordered Trees, and Binary Trees. Binary-Tree Traversals. Binary-Search Trees. Huffman Trees and Optimal Prefix Codes. Priority Trees. Counting Labeled Trees. Counting Binary Trees.
Spanning Trees
Tree Growing. Depth-First and Breadth-First Search. Minimum Spanning Trees and Shortest Paths. Applications of Depth-First Search. Cycles, Edge-Cuts, and Spanning Trees. Graphs and Vector Spaces. Matroids and the Greedy Algorithm.
Connectivity
Vertex and Edge-Connectivity. Constructing Reliable Networks. Max-Min Duality and Menger’s Theorems. Block Decompositions.
Optimal Graph Traversals
Eulerian Trails and Tours. DeBruijn Sequences and Postman Problems. Hamiltonian Paths and Cycles. Gray Codes and Traveling Salesman Problems.
Planarity and Kuratowski’s Theorem
Planar Drawings and Some Basic Surfaces. Subdivision and Homeomorphism. Extending Planar Drawings. Kuratowski’s Theorem. Algebraic Tests for Planairty. Planarity Algorithm. Crossing Numbers and Thickness.
Graph Colorings
Vertex-Colorings. Map-Colorings. Edge-Colorings. Factorization.
Special Digraph Models
Directed Paths and Mutual Reachability. Digraphs as Models for Relations. Tournaments. Project Scheduling. Finding the Strong Components of a Digraph.
Network Flows and Applications
Flows and Cuts in Networks. Solving the Maximum-Flow Problem. Flows and Connectivity. Matchings, Transversals, and Vertex Covers.
Graph Colorings and Symmetry
Automorphisms of Simple Graphs. Equivalence Classes of Colorings.
Appendix

Notă biografică

Jonathan L. Gross is a professor of computer science at Columbia University. His research interests include topology and graph theory.
Jay Yellen is a professor of mathematics at Rollins College. His current areas of research include graph theory, combinatorics, and algorithms.
Mark Anderson is also a mathematics professor at Rollins College. His research interest in graph theory centers on the topological or algebraic side.

Descriere

Graph Theory and Its Applications, Third Edition is the latest edition of the international, bestselling textbook for undergraduate courses in graph theory, yet it is expansive enough to be used for graduate courses as well. The textbook takes a comprehensive, accessible approach to graph theory, integrating careful exposition of classical developments with emerging methods, models, and practical needs.
The authors' unparalleled treatment is an ideal text for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
Features of the Third Edition

 

  • Expanded coverage on several topics (e.g., applications of graph coloring and tree-decompositions)
  • Provides better coverage of algorithms and algebraic and topological graph theory than any other text
  • Incorporates several levels of carefully designed exercises that promote student retention and develop and sharpen problem-solving skills
  • Includes supplementary exercises to develop problem-solving skills, solutions and hints, and a detailed appendix, which reviews the textbook's topics

About the Authors
Jonathan L. Gross is a professor of computer science at Columbia University. His research interests include topology and graph theory.
Jay Yellen is a professor of mathematics at Rollins College. His current areas of research include graph theory, combinatorics, and algorithms.
Mark Anderson is also a mathematics professor at Rollins College. His research interest in graph theory centers on the topological or algebraic side.