Accession Number:

ADA183315

Title:

On Finding the Vertex Connectivity of Graphs.

Descriptive Note:

Technical rept.,

Corporate Author:

ILLINOIS UNIV AT URBANA APPLIED COMPUTATION THEORY GROUP

Personal Author(s):

• Girkar,Milind
• Sohoni,Milind

Report Date:

1987-05-01

Pagination or Media Count:

7.0

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.

Descriptors:

• *NETWORK FLOWS
• *GRAPHS
• ALGORITHMS
• PROBLEM SOLVING

Subject Categories:

• Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE