The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters

Till Tantau. The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters. Electronic Colloquium on Computational Complexity (ECCC), 13(035), 2006. [doi]

Abstract

Abstract is missing.