On Finding the Vertex Connectivity of Graphs.

Abstract

An implementation of the fastest known algorithm to find the vertex connectivity of graphs with reduced space requirement is presented. Keyword: Network flows; Problem solving.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1987
Accession Number
ADA183315

Entities

People

  • Milind Girkar
  • Milind Sohoni

Organizations

  • University of Illinois Urbana–Champaign

Tags

Communities of Interest

  • Counter IED

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Computational Science
  • Computations
  • Illinois
  • Iterations
  • Mathematical Analysis
  • Mathematics
  • Military Research
  • Monitoring
  • Security
  • Separators
  • Universities

Technology Areas

  • Space