In the graph motif problem, we are given as input a vertex-colored graph H (the host graph) and a multiset of colors M (the motif).

In the graph motif problem, we are given as input a vertex-colored graph H (the host graph) and a multiset of colors M (the motif).

This talk reviews theory and engineering effort that resulted in an open-source algorithm implementation that scales in practice (as long as $k$ remains small) ...

Jan 12, 2017 · In the graph motif problem, we are given as input a vertexcolored graph H (the host graph) and a multiset of colors M (the motif).

Abstract. In the graph motif problem, we are given as input a vertex- colored graph H (the host graph) and a multiset of colors. M (the motif).

Jun 19, 2018 · Engineering motif search for large graphs. In Proceedings of the 17th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 104-118.

Engineering motif search for large graphs. Andreas Björklund. Lund ... For GRAPH MOTIF, can we engineer an implementation that scales to large graphs?

In the graph motif problem, we are given as input a vertex-colored graph H (the host graph) and a multiset of colors M (the motif).

Motif search on graphs is a hard generalization of jumbled pattern matching ... search for large graphs. In Proceedings of the 17th Workshop on Algorithm ...

Duration: 30:31
Posted: Nov 10, 2015