000			01910nmm a2200193Ia 4500
008			230306s9999||||xx |||||||||||||||||und||
020			_a9780821876770 (online)
245		0	_aGraphs and algorithms : _bproceedings of the AMSIMSSIAM joint summer research conference held June 28July 4, 1987 with support from the National Science Foundation
260			_aProvidence, R.I. : _bAmerican Mathematical Society, _cc1989
300			_a1 online resource (xv, 197 p. : ill.)
490			_aContemporary mathematics _vv. 89 _x10983627
500			_aThe AMSIMSSIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms was held at the University of Colorado, Boulder, ColoradoT.p. verso.
504			_aIncludes bibliographies.
505			_tThe RobertsonSeymour theorems: a survey of applications ; On genusreducing and planarizing algorithms for embedded graphs ; Interval hypergraphs ; Competitive algorithms for online 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 edgetoughness and fractional arboricity ; Directed Graphs and the Compaction of IC Designs ; Parallelism, preprocessing, and reachability ; A summary of results on pairconnected reliability ; On minimum cuts of cycles and maximum disjoint cycles ; Graphs and finitely presented groups ; Problem Corner _rMichael R Fellows ; Joan P Hutchinson ; Arnold L Rosenberg ; Mark S Manasse Lyle A McGeoch and Daniel D Sleator ; Larry I Basenspiler ; Mike Fried ; Robert Grossman and Richard G Larson ; Arthur M Hobbs ; Bradley W Jackson ; Philip N Klein ; Peter J Slater ; Jayme L Szwarcfiter ; Andrew Vince
650			_aComputer algorithms
650			_aGraph theory
700			_aRichter R Bruce
856			_uhttp://www.ams.org/conm/089/
999			_c28504 _d28504