Complexity of Combinatorial Algorithms.

Abstract

This paper examines recent work on the complexity of combinatorial algorithms, highlighting the aims of the work, the mathematical tools used, and the important results. Included are sections discussing ways to measure the complexity of an algorithm, methods for proving that certain problems are very hard to solve, tools useful in the design of good algorithms, and recent improvements in algorithms for solving ten representative problems. The final section suggests some directions for future research. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1977
Accession Number
ADA043362

Entities

People

  • Robert Tarjan

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I
  • Counter IED

DTIC Thesaurus Topics

  • Automata
  • Birds
  • Capillary Electrophoresis
  • Cis
  • Computer Science
  • Computers
  • Dermatologic Agents
  • Electric Vehicles
  • Geocells
  • Hash Tables
  • Movement Disorders
  • Occupational Safety And Health
  • Operating Systems
  • Quantum Cascade Lasers
  • Tin

Readers

  • Operations Research
  • Systems Analysis and Design