Title of article :
TRACTABILITY OF PARAMETERIZED COMPLETION PROBLEMS ON CHORDAL, STRONGLY CHORDAL, AND PROPER INTERVAL GRAPHS
Author/Authors :
KAPLAN، HAIM نويسنده , , SHAMIR، RON نويسنده , , TARJAN، ROBERT E. نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
Pages :
-1905
From page :
1906
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 :
design and analysis of algorithms , parameterized complexity , chordal graphs , minimum fill-in , proper interval graphs , physical mapping of DNA , strongly chordal graphs
Journal title :
SIAM Journal on Computing
Serial Year :
1999
Journal title :
SIAM Journal on Computing
Record number :
16617
Link To Document :
بازگشت