Graph-Theoretic Techniques for Parallel, Distributed, and Sequential Computation

Abstract

Parallel computation presents problems which are either nonexistent or trivial in the context of sequential computation. Thus, design of efficient algorithms for parallel and distributed computation requires development of new tools and techniques. This thesis considers a number of fundamental problems that arise in the context of parallel and distributed computation and describes several graph-theoretic techniques to address these problems. It also presents several new insights into the structure of various combinatorial optimization problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1988
Accession Number
ADA200989

Entities

People

  • Serge A. Plotkin

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computer Programming
  • Computer Science
  • Hierarchies
  • Linear Programming
  • Money
  • Networks
  • Numbers
  • Operations Research
  • Optimization
  • Real Numbers
  • Resource Management
  • Simplex Method
  • Simulations
  • Standards
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Parallel and Distributed Computing.
  • Systems Analysis and Design