ORPP logo
Image from Google Jackets

Graphs and Algorithms.

By: Material type: TextTextSeries: Contemporary MathematicsPublisher: Providence : American Mathematical Society, 1989Copyright date: ©1989Edition: 1st edDescription: 1 online resource (216 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780821876770
Subject(s): Genre/Form: Additional physical formats: Print version:: Graphs and AlgorithmsDDC classification:
  • 511/.5
LOC classification:
  • QA166 -- .A47 1987eb
Online resources:
Contents:
Intro -- Contents -- Foreword -- Organizing Committee -- List of Participants -- The Robertson-Seymour theorems: A survey of applications -- On genus-reducing and planarizing algorithms for embedded graphs -- Interval hypergraphs -- Competitive algorithms for on-line 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 edge-toughness and fractional arboricity -- Directed graphs and the compaction of IC designs -- Parallelism, preprocessing, and reachability -- A summary of results on pair-connected reliability -- On minimum cuts of cycles and maximum disjoint cycles -- Graphs and finitely presented groups -- Problem corner.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Intro -- Contents -- Foreword -- Organizing Committee -- List of Participants -- The Robertson-Seymour theorems: A survey of applications -- On genus-reducing and planarizing algorithms for embedded graphs -- Interval hypergraphs -- Competitive algorithms for on-line 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 edge-toughness and fractional arboricity -- Directed graphs and the compaction of IC designs -- Parallelism, preprocessing, and reachability -- A summary of results on pair-connected reliability -- On minimum cuts of cycles and maximum disjoint cycles -- Graphs and finitely presented groups -- Problem corner.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

There are no comments on this title.

to post a comment.

© 2024 Resource Centre. All rights reserved.