AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Graphs and Algorithms
About this Title
R. Bruce Richter, Editor
Publication: Contemporary Mathematics
Publication Year:
1989; Volume 89
ISBNs: 978-0-8218-5095-4 (print); 978-0-8218-7677-0 (online)
DOI: https://doi.org/10.1090/conm/089
MathSciNet review: 1006471
Table of Contents
Download chapters as PDF
Front/Back Matter
Articles
- Michael R. Fellows – The Robertson-Seymour theorems: a survey of applications [MR 1006472]
- Joan P. Hutchinson – On genus-reducing and planarizing algorithms for embedded graphs [MR 1006473]
- Arnold L. Rosenberg – Interval hypergraphs [MR 1006474]
- Mark S. Manasse, Lyle A. McGeoch and Daniel D. Sleator – Competitive algorithms for on-line problems [MR 1006475]
- Larry I. Basenspiler – On recognizability of planar graphs [MR 1006476]
- Mike Fried – Combinatorial computation of moduli dimension of Nielsen classes of covers [MR 1006477]
- Robert Grossman and Richard G. Larson – Labeled trees and the algebra of differential operators [MR 1006478]
- Arthur M. Hobbs – Computing edge-toughness and fractional arboricity [MR 1006479]
- Bradley W. Jackson – Directed Graphs and the Compaction of IC Designs
- Philip N. Klein – Parallelism, preprocessing, and reachability [MR 1006481]
- Peter J. Slater – A summary of results on pair-connected reliability [MR 1006482]
- Jayme L. Szwarcfiter – On minimum cuts of cycles and maximum disjoint cycles [MR 1006483]
- Andrew Vince – Graphs and finitely presented groups [MR 1006484]
- Edited by R. Bruce Richter – Problem Corner