In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Abstract. Understanding relationships and commonalities between digital contents based on metadata is a difficult user task that requires sophisticated presentation forms. In this ...
Steffen Lohmann, Philipp Heim, Lena Tetzlaff, Thom...
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...