University of Illinois Urbana-Champaign

Finding All Minimum Size Separating Vertex Sets in a Graph

Kanevsky, Arkady

Content Files
B37-ACT_93.pdf

Permalink

https://hdl.handle.net/2142/74264

Description

Title
Finding All Minimum Size Separating Vertex Sets in a Graph
Author(s)
Kanevsky, Arkady
Issue Date
1988-07
Keyword(s)
  • Network reliability
  • Graph theory
  • Separating sets
  • Algorithms
Date of Ingest
  • 2015-04-06T20:52:50Z
  • 2017-07-14T23:10:01Z
Publisher
Applied Computation Theory, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign
Series/Report Name or Number
Coordinated Science Laboratory Report no. UILU-ENG-88-2233, ACT-93
Type of Resource
text
Genre of Resource
Report (Grant or Annual)
Language
English
Permalink
http://hdl.handle.net/2142/74264
Sponsor(s)/Grant Number(s)
Semiconductor Research Corporation / 87-DP-109

Owning Collections

Report - Coordinated Science Laboratory PRIMARY