Files in this item

FilesDescriptionFormat

application/pdf

application/pdfB37-ACT_93.pdf (5MB)
(no description provided)PDF

Description

Title:Finding All Minimum Size Separating Vertex Sets in a Graph
Author(s):Kanevsky, Arkady
Subject(s):Network reliability
Graph theory
Separating sets
Algorithms
Issue Date:1988-07
Publisher:Coordinated Science Laboratory
Series/Report:Coordinated Science Laboratory Report no. UILU-ENG-88-2233, ACT-93
Genre:Report
Type:Text
Language:English
Description:Coordinated Science Laboratory was formerly known as Control Systems Laboratory
URI:http://hdl.handle.net/2142/74264
Sponsor:Semiconductor Research Corporation / 87-DP-109
Date Available in IDEALS:2015-04-06


This item appears in the following Collection(s)

Item Statistics