140 citations · 140 across the 2 of their papers we have counts for
5 papers
Finding Largest Common Substructures of Molecules in Quadratic Time
Andre Droschinsky, Nils Kriege, Petra Mutzel
Finding the common structural features of two molecules is a fundamental task in cheminformatics. Most drugs are small molecules, which can naturally be interpreted as graphs. Henc…
StruClus: Structural Clustering of Large-Scale Graph Databases
Till Schäfer, Petra Mutzel
We present a structural clustering algorithm for large-scale datasets of small labeled graphs, utilizing a frequent subgraph sampling strategy. A set of representatives provides an…
Compact Layered Drawings of General Directed Graphs
Adalat Jabrayilov, Sven Mallach, Petra Mutzel +2
We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a la…
Drawing Partially Embedded and Simultaneously Planar Graphs
Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger +3
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing…
Subgraph Matching Kernels for Attributed Graphs
Nils Kriege, Petra Mutzel
We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al.…