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 /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores Corporativos: AMS-IMS-SIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms University of Colorado, American Mathematical Society, Institute of Mathematical Statistics, Society for Industrial and Applied Mathematics
Otros Autores: Richter, R. Bruce
Formato: Electrónico Congresos, conferencias eBook
Idioma:Inglés
Publicado: Providence, R.I. : American Mathematical Society, ©1989.
Colección:Contemporary mathematics (American Mathematical Society) ; v. 89.
Temas:
Graph theory > Congresses.
Computer algorithms > Congresses.
Algorithmes > Congrès.
Computer algorithms
Graph theory
Conference papers and proceedings
Acceso en línea:Texto completo
Tabla de Contenidos:
  • The Robertson-Seymour theorems: a survey of applications / Michael R. Fellows
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006472 On genus-reducing and planarizing algorithms for embedded graphs / Joan P. Hutchinson
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006473 Interval hypergraphs / Arnold L. Rosenberg
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006474 Competitive algorithms for on-line problems / Mark S. Manasse, Lyle A. McGeoch and Daniel D. Sleator
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006475 On recognizability of planar graphs / Larry I. Basenspiler
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006476 Combinatorial computation of moduli dimension of Nielsen classes of covers / Mike Fried
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006477 Labeled trees and the algebra of differential operators / Robert Grossman and Richard G. Larson
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006478 Computing edge-toughness and fractional arboricity / Arthur M. Hobbs
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006479 Directed Graphs and the Compaction of IC Designs / Bradley W. Jackson
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/09 Parallelism, preprocessing, and reachability / Philip N. Klein
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006481 A summary of results on pair-connected reliability / Peter J. Slater
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006482 On minimum cuts of cycles and maximum disjoint cycles / Jayme L. Szwarcfiter
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006483 Graphs and finitely presented groups / Andrew Vince
  • http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/1006484 Problem Corner http://www.ams.org/conm/089/ http://dx.doi.org/10.1090/conm/089/13

Ejemplares similares