Title of article
A TIME-SPACE TRADEOFF FOR UNDIRECTED GRAPH TRAVERSAL BY WALKING AUTOMATA*
Author/Authors
RAGHAVAN، PRABHAKAR نويسنده , , BEAME، PAUL نويسنده , , BORODIN، ALLAN نويسنده , , R.UZZO، WALTER L. نويسنده , , TOMPA، MARTIN نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-1050
From page
1051
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
graph connectivity , graph reachability , time-space tradeoff , walking automaton , jumping automaton , JAG
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16509
Link To Document