On Finding the Vertex Connectivity of Graphs.

reportActive / Technical Report | Accession Number: ADA183315 | Open PDF

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.

Author(s):
Girkar, Milind ; Sohoni, Milind
Author Organization(s):
ILLINOIS UNIV AT URBANA APPLIED COMPUTATION THEORY GROUP
Descriptive Note:
Technical rept.,
Supplementary Note:
Sponsored in part by grants NSF-DCR84-06916 and DE-FG02-85ER25001.
Pagination:
0007

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
ACT-77, UILU-ENG-87-2232
Contract/Grant Number(s):
N00014-84-C-0149, NSF-DCR84-10110
 Subject Terms
Joint Capability Areas:
JCA_6_Net Centric; JCA_6.1_Information Transport; JCA_1.2.5_Lessons Learned; JCA_1.2_Force Preparation; JCA_1_Force Support
Communities of Interest:
Counter IED
Descriptor(s):
*NETWORK FLOWS, *GRAPHS, ALGORITHMS, PROBLEM SOLVING
Field(s)/Group(s):
Theoretical Mathematics
Keyword(s):
Vertex connectivity, Even algorithm
Report Date:
1987 May 01