CYCLES WITH MINIMUM AVERAGE LENGTH

Abstract

Given a directed network whose arcs have lengths unrestricted in sign and which contains at least one cycle, an algorithm to find the minimum average length cycle (length divided by its number of arcs) is described. A direct application of this algorithm solves the problem of finding whether a directed graph contains a cycle with negative length.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1967
Accession Number
AD0656471

Entities

People

  • Alain Fillieres

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Computations
  • Dynamic Programming
  • Engineering
  • Markov Chains
  • Markov Processes
  • Mathematics
  • Military Research
  • New York
  • North Carolina
  • Operations Research
  • United States
  • United States Government
  • Universities

Fields of Study

  • Computer science

Readers

  • Calculus or Mathematical Analysis
  • Mathematics or Statistics
  • Plasma Physics.