Kernelization and parameterized algorithms for covering a tree by a set of stars or paths

Two restricted versions of the Subforest Isomorphism problem, the Covering a Tree by a Set of Stars (CTSS) and the Covering a Tree by a Set of Paths (CTSP) problems, are studied. Both problems are NP-complete. The problems are closely related to a number of well-studied problems, including the problems Subgraph Isomorphism, Tree Editing, and Graph Packing. It is shown that the problems CTSS and CTSP are fixed-parameter tractable. Thorough development of parameterized algorithms and kernelization algorithms for these problems are presented.

[1]  Bonnie Kirkpatrick,et al.  Comparing Pedigree Graphs , 2010, J. Comput. Biol..

[2]  Tao Jiang,et al.  Some MAX SNP-Hard Results Concerning Unordered Labeled Trees , 1994, Inf. Process. Lett..

[3]  Maurizio A. Bonuccelli,et al.  Minimum Node Disjoint Path Covering for Circular-Arc Graphs , 1979, Inf. Process. Lett..

[4]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[5]  Feng Shi,et al.  Algorithms for parameterized maximum agreement forest problem on multiple trees , 2014, Theor. Comput. Sci..

[6]  Kaleem Siddiqi,et al.  Matching Hierarchical Structures Using Association Graphs , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Philip N. Klein,et al.  A tree-edit-distance algorithm for comparing simple, closed shapes , 2000, SODA '00.

[8]  Robert E. Stobaugh.  Chemical substructure searching , 1985, J. Chem. Inf. Comput. Sci..

[9]  Jiong Guo,et al.  Covering Tree with Stars , 2013, COCOON.

[10]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[11]  Maw-Shang Chang,et al.  Solving the path cover problem on circular-arc graphs by using an approximation algorithm , 2006, Discret. Appl. Math..

[12]  Nelson Max.  Computer representation of molecular surfaces , 1984 .

[13]  Amihood Amir,et al.  Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms , 1997, SIAM J. Comput..

[14]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[15]  Tao Jiang,et al.  On the minimum common integer partition problem , 2006, TALG.

[16]  Mong-Li Lee,et al.  Finding hot query patterns over an XQuery stream , 2004, The VLDB Journal.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Raphael Yuster,et al.  Combinatorial and computational aspects of graph packing and graph decomposition , 2007, Comput. Sci. Rev..

[19]  Amr Elmasry,et al.  Multipartite priority queues , 2008, TALG.

[20]  Susan Anderson,et al.  Graphical representation of molecules and substructure-search queries in MACCStm , 1984 .

[21]  Philip Bille,et al.  A survey on tree edit distance and related problems , 2005, Theor. Comput. Sci..

[22]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..