Graphs and Algorithms

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Supplemental Materials

Please wait while the item is added to your bag...

The Robertson-Seymour theorems: A survey of applications
On genus-reducing and planarizing algorithms for embedded graphs
Interval hypergraphs
Competitive algorithms for on-line problems
On recognizability of planar graphs
Combinatorial computation of moduli dimension of Nielsen classes of covers
Labeled trees and the algebra of differential operators
Computing edge-toughness and fractional arboricity
Directed graphs and the compaction of IC designs
Parallelism, preprocessing, and reachability
A summary of results on pair-connected reliability
On minimum cuts of cycles and maximum disjoint cycles
Graphs and finitely presented groups
Table of Contents provided by Publisher. All Rights Reserved.