Kocay / Kreher Graphs, Algorithms, and Optimization, Second Edition

2. Auflage 2016
ISBN: 978-1-4822-5118-0
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, 566 Seiten

Reihe: Discrete Mathematics and Its Applications

This comprehensive text features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. It covers the major areas of graph theory, including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions on linear programming that emphasize graph theory problems useful in mathematics and computer science. Many algorithms are provided along with the data structure needed to program the algorithms efficiently.

Zielgruppe

This book is intended for an upper division undergraduate first course in graph theory. It also could be used in a first year graduate course in graph theory.

Autoren/Hrsg.

Kocay, William

Kreher, Donald L.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Betriebssysteme
• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik

Inhaltsverzeichnis

Graphs and Their Complements. Paths and Walks. Some Special Classes of Graphs. Trees and Cycles. The Structure of Trees. Connectivity. Alternating Paths and Matchings. Network Flows. Hamilton Cycles. Tsp. Digraphs. Graph Colorings. Planar Graphs. Graphs and Surfaces. Linear Programming. Discrete Linear Programming. Bibliography. Index.

Über Autor(innen)

William Kocay is a professor in the Department of Computer Science at St. Paul's College of the University of Manitoba, Canada.

Donald Kreher is a professor of mathematical sciences at Michigan Technological University, Houghton, Michigan.