Graphs and Algorithms: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference Held June 28-July 4, 1987 with Support from the National Science FoundationThis volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graphs and Algorithms, held in 1987 at the University of Colorado in Boulder. The purpose of the conference was to foster communication between computer scientists and mathematicians, for recent work in graph theory and related algorithms has relied on increasingly sophisticated mathematics. Wagner's Conjecture, self-adjusting data structures, graph isomorphism, and various embedding and labelling problems in VLSI are examples of the kinds of questions now facing the field. With around 65 participants, the conference brought out the depth and diversity of current research in this area. The wide range of topics covered in this volume demonstrates the vitality of the activity in both mathematics and computer science and captures the diversity and excitement of the conference. |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
A survey of applications | 1 |
On genusreducing and planarizing algorithms for embedded graphs | 19 |
Interval hypergraphs | 27 |
Competitive algorithms for online problems | 45 |
On recognizability of planar graphs | 55 |
Combinatorial computation of moduli dimension of Nielsen classes of covers | 61 |
Labeled trees and the algebra of differential operators | 81 |
Computing edgetoughness and fractional arboricity | 89 |
Directed graphs and the compaction of IC designs | 107 |
Parallelism preprocessing and reachability | 129 |
A summary of results on pairconnected reliability | 145 |
On minimum cuts of cycles and maximum disjoint cycles | 153 |
Graphs and finitely presented groups | 167 |
Problem corner | 187 |
Other editions - View all
Common terms and phrases
algebraic antichain apply branch cycles c-competitive Cayley graph chain closure combinatorial competitive algorithm complexity computation conjecture connectively reducible consider constraint graph construction contains COROLLARY cover critical cycle critical vertices curves decomposition defined denote disjoint edge of G Editor elements embedded graph exists family of graphs finitely presented group full moduli dimension fundamental group Galois genus g given graph G Graph Theory graphical representation group G hyperedges I-hypergraph induced integer interval graphs interval hypergraph isomorphic k-server problem labeled layout lemma linear Math matroid maximum minimum minor order monodromy group n-vertex nodes nontrivial NP-complete obtained operations partial order partition path path-graph permutation planar graph polynomial poset processors proof reachable reducible digraphs reliability result Robertson-Seymour solvable solvable groups spanning trees step strongly connected component strongly universal subgraphs of G subgroup subset surface symmetry task system Theorem values variable constraint vector Zariski
Bibliographic information
| Title | Graphs and Algorithms: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference Held June 28-July 4, 1987 with Support from the National Science Foundation Volume 89 of Contemporary mathematics - American Mathematical Society Issue 89 of Contemporary mathematics, ISSN 0271-4132 The AMS-IMS-SIAM joint summer research conference in the mathematical sciences |
| Authors | Ams-Ims-Siam Joint Summer Research Conference in the Mathematical Scie, R. Bruce Richter |
| Editors | R. Bruce Richter, Robert Bruce Richter |
| Contributors | Institute of Mathematical Statistics, Society for Industrial and Applied Mathematics |
| Publisher | American Mathematical Soc., 1989 |
| ISBN | 0821850954, 9780821850954 |
| Length | 197 pages |
| Subjects | › Mathematics / Graphic Methods |
| Export Citation | BiBTeX EndNote RefMan |