Title of article
LINEAR TIME ALGORITHMS FOR DOMINATING PAIRS IN ASTEROIDAL TRIPLE-FREE GRAPHS
Author/Authors
CORNEIL، DEREK G. نويسنده , , OLARIU، STEPHAN نويسنده , , STEWART، LORNA نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-1283
From page
1284
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
dominating pairs , lexicographic breadth-first search , asteroidal triple-free graphs , Algorithms
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16564
Link To Document