Graph Theory and Its Applications: Textbooks in Mathematics
Autor Jonathan L. Gross, Jay Yellen, Mark Andersonen Limba Engleză Paperback – 21 ian 2023
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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 350.92 lei 22-36 zile | +56.74 lei 5-11 zile |
CRC Press – 21 ian 2023 | 350.92 lei 22-36 zile | +56.74 lei 5-11 zile |
Hardback (1) | 599.41 lei 22-36 zile | +47.65 lei 5-11 zile |
CRC Press – 6 noi 2018 | 599.41 lei 22-36 zile | +47.65 lei 5-11 zile |
Din seria Textbooks in Mathematics
- 8% Preț: 409.21 lei
- Preț: 347.69 lei
- 9% Preț: 645.78 lei
- Preț: 349.23 lei
- 8% Preț: 405.55 lei
- Preț: 355.02 lei
- 8% Preț: 547.52 lei
- 9% Preț: 644.77 lei
- Preț: 308.35 lei
- Preț: 331.58 lei
- Preț: 341.89 lei
- 8% Preț: 406.96 lei
- 8% Preț: 410.18 lei
- Preț: 311.70 lei
- 9% Preț: 607.23 lei
- 9% Preț: 610.96 lei
- 8% Preț: 533.09 lei
- 9% Preț: 942.43 lei
- Preț: 358.19 lei
- 8% Preț: 408.94 lei
- 8% Preț: 545.73 lei
- Preț: 354.14 lei
- 20% Preț: 561.05 lei
- Preț: 347.35 lei
- 20% Preț: 559.81 lei
- Preț: 341.55 lei
- 20% Preț: 295.42 lei
- 8% Preț: 410.53 lei
- 8% Preț: 407.55 lei
- Preț: 343.76 lei
- 9% Preț: 580.22 lei
- 8% Preț: 490.79 lei
- 8% Preț: 392.61 lei
- 9% Preț: 597.57 lei
- Preț: 354.33 lei
- 20% Preț: 573.73 lei
- Preț: 309.41 lei
- Preț: 347.74 lei
- Preț: 345.53 lei
- Preț: 390.22 lei
- 9% Preț: 591.99 lei
Preț: 350.92 lei
Nou
Puncte Express: 526
Preț estimativ în valută:
67.16€ • 69.76$ • 55.79£
67.16€ • 69.76$ • 55.79£
Carte disponibilă
Livrare economică 13-27 ianuarie 25
Livrare express 27 decembrie 24 - 02 ianuarie 25 pentru 66.73 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781032475950
ISBN-10: 1032475951
Pagini: 592
Ilustrații: 905
Dimensiuni: 178 x 254 x 35 mm
Greutate: 1.34 kg
Ediția:3
Editura: CRC Press
Colecția CRC Press
Seria Textbooks in Mathematics
Locul publicării:Boca Raton, United States
ISBN-10: 1032475951
Pagini: 592
Ilustrații: 905
Dimensiuni: 178 x 254 x 35 mm
Greutate: 1.34 kg
Ediția:3
Editura: CRC Press
Colecția CRC Press
Seria Textbooks in Mathematics
Locul publicării:Boca Raton, United States
Public țintă
AcademicCuprins
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
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.
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 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, an