Title of article
Various Results on the Toughness of Graphs
Author/Authors
Broersma، Hajo نويسنده , , Engbers، Erik نويسنده , , Trommel، Huib نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-232
From page
233
To page
0
Abstract
We study the probabilistic longest path problem. We propose a modification strategy adapting a solution for a deterministic instance to a solution for the probabilistic one, we compute the functional associated with this strategy, and we evaluate the complexities of computing this functional and of computing the deterministic solution maximizing it. © 1999 John Wiley & Sons, Inc. Networks 33: 207-219, 1999
Keywords
t-tough graph , toughness (of subgraphs) , square of a graph , degree sum condition , minimally t-tough graph
Journal title
NETWORKS
Serial Year
1999
Journal title
NETWORKS
Record number
13451
Link To Document