A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A topological approach to evasiveness
1984
Combinatorica
The complexity of a digraph property is the number of entries of the vertex adjacency matrix of a digraph which must be examined in worst case to determine whether the graph has the property. Rivest and Vuillemin proved the result (conjectured by Aanderaa and Rosenberg) that every graph property that is monotone (preserved by addition of edges) and nontrivial (holds for some but not all graphs) has complexity £2(v ~) where v is the number of vertices. Karp conjectured that every such property
doi:10.1007/bf02579140
fatcat:wmx24dtqjvfg7g5amsijweow64