A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Let G = (V, E) be a vertex-colored graph, where C is the set of colors used to color V . The Graph Motif (or GM) problem takes as input G, a multiset M of colors built from C, and asks whether there is a subset S ⊆ V such that (i) G[S] is connected and (ii) the multiset of colors obtained from S equals M . The Colorful Graph Motif (or CGM) problem is the special case of GM in which M is a set, and the List-Colored Graph Motif (or LGM) problem is the extension of GM in which each vertex v of Vdoi:10.7155/jgaa.00538 fatcat:h2v2ixkz4nd4fjjogpym3gqcqa