LS sets as cohesive subsets of graphs and hypergraphs (Q800386)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3875338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LS sets as cohesive subsets of graphs and hypergraphs |
scientific article; zbMATH DE number 3875338 |
Statements
LS sets as cohesive subsets of graphs and hypergraphs (English)
0 references
1983
0 references
A class of network cutsets (LS sets) introduced by Luccio and Sami is characterized in a simple way which is used to prove that LS sets are either disjoint or nested.
0 references
clique
0 references
network decomposition
0 references
hierarchical partitions
0 references
network cutsets
0 references
0.6942592263221741
0 references
0.6895484328269958
0 references
0.6870729327201843
0 references
0.6839109659194946
0 references
