Algorithmic Graph Theory and Perfect Graphs

ISBN-10: 0444515305
ISBN-13: 9780444515308
Edition: 2nd 2004 (Revised)
List price: $83.95 Buy it from $53.58
eBook available
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

New Starting from $91.60
eBooks Starting from $101.00
Buy
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $83.95
Edition: 2nd
Copyright year: 2004
Publisher: Elsevier Science & Technology Books
Publication date: 2/4/2004
Binding: Hardcover
Pages: 340
Size: 6.50" wide x 9.50" long x 0.75" tall
Weight: 1.694
Language: English

Foreword 2004
Foreword
Preface
Acknowledgments
List of Symbols
Corrections and Errata
Graph Theoretic Foundations
The Design of Efficient Algorithms
Perfect Graphs
Triangulated Graphs
Comparability Graphs
Split Graphs
Permutation Graphs
Interval Graphs
Superperfect Graphs
Threshold Graphs
Not So Perfect Graphs
Perfect Gaussian Elimination
A Small Collection of NP-Complete Problems
An Algorithm for Set Union, Intersection, Difference, and Symmetric Difference of Two Subsets
Topological Sorting: An Example of Algorithm 2.4
An Illustration of the Decomposition Algorithm
The Properties P.E.B., C.B., (P.E.B.)', (C.B.)' Illustrated
The Properties C, C, T, T Illustrated
Epilogue 2004
Index

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×