Graphs and algorithms : proceedings of the AMSIMSSIAM joint summer research conference held June 28July 4, 1987 with support from the National Science Foundation

Contributor(s): Richter R BruceMaterial type: Computer fileComputer fileSeries: Contemporary mathematics ; v. 89Publication details: Providence, R.I. : American Mathematical Society, c1989Description: 1 online resource (xv, 197 p. : ill.)ISBN: 9780821876770 (online)Subject(s): Computer algorithms | Graph theoryOnline resources: Click here to access online
Contents:
The 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 Michael 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
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Call number URL Status Date due Barcode Item holds
electronic book electronic book ICTS
Link to resource Accessible Online EBK21091
Total holds: 0

The AMSIMSSIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms was held at the University of Colorado, Boulder, ColoradoT.p. verso.

Includes bibliographies.

The 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 Michael 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

There are no comments on this title.

to post a comment.