Graphs and Algorithms
Saved in:
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Providence, Rhode Island
American Mathematical Society
1989
|
| Edition: | 1 |
| Series: | Contemporary Mathematics |
| Subjects: | |
| ISBN: | 0821850954, 9780821850954 |
| ISSN: | 0271-4132, 1098-3627 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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 -- Problem Corner
- Intro -- Contents -- Foreword -- Organizing Committee -- List of Participants -- 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 -- Problem corner