Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Graphs and Algorithms
 
Edited by: R. Bruce Richter
Graphs and Algorithms
Softcover ISBN:  978-0-8218-5095-4
Product Code:  CONM/89
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7677-0
Product Code:  CONM/89.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-5095-4
eBook: ISBN:  978-0-8218-7677-0
Product Code:  CONM/89.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
Graphs and Algorithms
Click above image for expanded view
Graphs and Algorithms
Edited by: R. Bruce Richter
Softcover ISBN:  978-0-8218-5095-4
Product Code:  CONM/89
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7677-0
Product Code:  CONM/89.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-5095-4
eBook ISBN:  978-0-8218-7677-0
Product Code:  CONM/89.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 891989; 197 pp
    MSC: Primary 05; Secondary 00; 68

    This 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.

  • Table of Contents
     
     
    • 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
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 891989; 197 pp
MSC: Primary 05; Secondary 00; 68

This 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.

  • 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
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.