Title of article
DIAGNOSIS OF WIRING NETWORKS: AN OPTIMAL RANDOMIZED ALGORITHM FOR FINDING CONNECTED COMPONENTS OF UNKNOWN GRAPHS
Author/Authors
SHI، WEIPING نويسنده , , WEST، DOUGLAS B. نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-1540
From page
1541
To page
0
Abstract
This paper describes the potential suitability of a new family of concrete mixtures for use in protective structures. Two very-high-strength concrete mixtures are discussed and experimental results of penetration studies on one of these are presented. The results are compared to penetration-study results of other, more conventional concrete mixtures, and the advantages of the very-high-strength mixtures are described.
Keywords
randomized algorithm , graph , Fault diagnosis , lower bound , connection class , component
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16587
Link To Document