Deterministic parameterized algorithms for the Graph Motif problem

We study the classic Graph Motif problem. Given a graph G=(V,E) with a set of colors for each node, and a multiset M of colors, we seek a subtree T⊆G, and a coloring assigning to each node in T a color from its set, such that T carries exactly (also with respect to multiplicity) the colors in M. Gra...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 213; pp. 162 - 178
Main Authors:	Pinter, Ron Y., Shachnai, Hadas, Zehavi, Meirav
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 20.11.2016
Subjects:	Graph motif Guiding tree Parameterized algorithm Representative family RGM Parameterized algorithm Representative family GM Graph motif Guiding tree
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!