Expressiveness and Complexity of Generic Graph Machines.

Marc Gemis Jan Paredaens Peter Peelman Jan Van den Bussche

Published in: Theory Comput. Syst. (1998)

Keyphrases

expressive power
graph theory
polynomial time complexity
graph search
random walk
domain specific
connected components
worst case
directed graph
weighted graph
space complexity
graph partitioning
computational properties
computational cost
causal graph
dependency graph
data mining