Cut-threshold graphs (Q2277496)
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 4196024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cut-threshold graphs |
scientific article; zbMATH DE number 4196024 |
Statements
Cut-threshold graphs (English)
0 references
1991
0 references
The authors study the structure of the networks in which connectedness and disconnectedness can be expressed by a threshold system. So the elements of the network have a certain ``destruction cost'' and an enemy can disconnect the network if and only if he pays a large enough price. The authors give polynomial algorithms for the recognition of such networks, and for the determination of the appropriate costs and threshold value.
0 references
cut-threshold graph
0 references
connectedness
0 references
disconnectedness
0 references
polynomial algorithms
0 references
0.7547036409378052
0 references
0.7374990582466125
0 references
0.7369004487991333
0 references
0.7363555431365967
0 references
0.7354922890663147
0 references
