Cut-threshold graphs

Cut-threshold graphs

0.00 Avg rating0 Votes
Article ID: iaor19911700
Country: Netherlands
Volume: 30
Issue: 2/3
Start Page Number: 163
End Page Number: 179
Publication Date: Feb 1991
Journal: Discrete Applied Mathematics
Authors: , ,
Abstract:

The authors study the structure of the networks in which connectedness and disconnectedness can be expressed by a threshold system. This means that the elements of the network have a certain ‘destruction cost’ and that the enemy can disconnect the network if and only if they pay 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.

Reviews

Required fields are marked *. Your email address will not be published.