BN.com Gift Guide

Graph Theory [NOOK Book]

Overview

An introductory text in graph theory, this treatment covers primary techniques and includes both algorithmic and theoretical problems. Algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as mathematicians studying topology, algebra, and matrix theory.
Read More Show Less
... See more details below
Graph Theory

Available on NOOK devices and apps  
  • NOOK Devices
  • Samsung Galaxy Tab 4 NOOK 7.0
  • Samsung Galaxy Tab 4 NOOK 10.1
  • NOOK HD Tablet
  • NOOK HD+ Tablet
  • NOOK eReaders
  • NOOK Color
  • NOOK Tablet
  • Tablet/Phone
  • NOOK for Windows 8 Tablet
  • NOOK for iOS
  • NOOK for Android
  • NOOK Kids for iPad
  • PC/Mac
  • NOOK for Windows 8
  • NOOK for PC
  • NOOK for Mac
  • NOOK for Web

Want a NOOK? Explore Now

NOOK Book (eBook)
$11.49
BN.com price
(Save 42%)$19.99 List Price

Overview

An introductory text in graph theory, this treatment covers primary techniques and includes both algorithmic and theoretical problems. Algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as mathematicians studying topology, algebra, and matrix theory.
Read More Show Less

Product Details

  • ISBN-13: 9780486320366
  • Publisher: Dover Publications
  • Publication date: 8/30/2013
  • Sold by: Barnes & Noble
  • Format: eBook
  • Pages: 352
  • Sales rank: 670,964
  • File size: 12 MB
  • Note: This product may take a few minutes to download.

Table of Contents

Chapter 1 Graphs

1.0 Introduction 1

1.1 Fundamental Concepts and Notation 1

1.2 Elementary Properties and Operations 8

1.3 Alternate Representations for Graphs 14

1.4 Algorithms 16

1.5 Degree Sequences 19

1.6 Fundamental Counting 25

Chapter 2 Paths and Searching

2.1 Distance 33

2.2 Connectivity 47

2.3 Digraph Connectivity 56

2.4 Problem Solving and Heuristics 59

Chapter 3 Trees

3.1 Fundamental Properties of Trees 69

3.2 Minimal Weight Spanning Trees 71

3.3 Counting Trees 76

3.4 Directed Trees 80

3.5 Optimal Directed Subgraphs 86

3.6 Binary Trees 90

3.7 More About Counting-Using Generating Functions 99

Chapter 4 Networks

4.1 Flows 105

4.2 The Ford and Fulkerson Approach 107

4.3 The Dinic Algorithm and Layered Networks 114

4.4 Layered Networks and Potential 118

4.5 Variations on Networks 119

4.6 Connectivity and Networks 124

Chapter 5 Cycles and Circuits

5.1 Eulerian Graphs 131

5.2 Adjacency Conditions for Hamiltonian Graphs 137

5.3 Related Hamiltonian-like Properties 146

5.4 Forbidden Subgraphs 149

5.5 Other Types of Hamiltonian Results 153

5.6 The Traveling Salesman Problem 155

5.7 Short Cycles and Girth 157

5.8 Disjoint Cycles 160

Chapter 6 Planarity

6.1 Euler's Formula 171

6.2 Characterizations of Planar Graphs 174

6.3 A Planarity Algorithm 184

6.4 The Hopcroft-Tarjan Planarity Algorithm 188

6.5 Hamiltonian Planar Graphs 196

Chapter 7 Matchings

7.0 Introduction 201

7.1 Matchings and Bipartite Graphs 201

7.2 Matching Algorithms and Marriage 207

7.3 Factoring 219

7.4 Degrees and 2-Factors 225

Chapter 8 Independence

8.1 Vertex Independence and Coverings 233

8.2 Vertex Colorings 235

8.3 Approximate Coloring Algorithms 240

8.4 Edge Colorings 246

8.5 The Four Color Theorem 250

8.6 Chromatic Polynomials 252

8.7 Perfect Graphs 254

Chapter 9 Special Topics and Applications

9.1 Graphs and Ordered Sets 261

9.2 Random Graphs 266

9.3 Ramsey Theory 272

9.4 Finite State Machines 278

9.5 Scheduling 283

9.6 Tournaments 289

Chapter 10 Extremal Theory

10.0 Introduction 301

10.1 Complete Subgraphs 302

10.2 Cycles in Graphs 310

10.3 On the Structure of Extremal Graphs 315

Appendix 327

Index 329

Read More Show Less

Customer Reviews

Average Rating 2
( 1 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(1)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted November 16, 2014

    Garrett's graph of rp usage for the last year

    &#9606&#9607&#9605&#9605&#9607&#9604&#9603&#9605&#9606&#9607&#9607 decamber yet to be determind

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)