arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.05110cs.DS
收藏

由输入图的结构参数化的图Motif问题

The Graph Motif problem parameterized by the structure of the input graph

Édouard Bonnet, Florian Sikora

摘要:

Graph Motif问题于2006年在生物网络的背景下引入。它包括决定是否有一个多集的颜色出现在一个顶点着色图的连通子图。图模体的分析主要是从参数化复杂性的角度进行的。考虑的主要参数是多集的大小和颜色的数量。然而,在Graph Motif的许多应用中,输入的图来源于现实生活,并且具有结构。基于这一发现,我们系统地研究了它的复杂性与图的结构参数的关系。对于广泛的参数,我们给出了新的或改进的FPT算法,或表明,该问题仍然是棘手的。对于FPT的情况下,我们也给出了一些内核化的下界以及一些基于ETH的最坏情况下的运行时间的下界。有趣的是,我们建立了Graph Motif对于参数max leaf number是W[1]-hard(而在W[P]中),据我们所知,这是第一个以这种方式表现的问题。

英文摘要:

The Graph Motif problem was introduced in 2006 in the context of biological networks. It consists of deciding whether or not a multiset of colors occurs in a connected subgraph of a vertex-colored graph. Graph Motif has been mostly analyzed from the standpoint of parameterized complexity. The main parameters which came into consideration were the size of the multiset and the number of colors. Though, in the many applications of Graph Motif, the input graph originates from real-life and has structure. Motivated by this prosaic observation, we systematically study its complexity relatively to graph structural parameters. For a wide range of parameters, we give new or improved FPT algorithms, or show that the problem remains intractable. For the FPT cases, we also give some kernelization lower bounds as well as some ETH-based lower bounds on the worst case running time. Interestingly, we establish that Graph Motif is W[1]-hard (while in W[P]) for parameter max leaf number, which is, to the best of our knowledge, the first problem to behave this way.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑