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

一种有效的DAG漏斗度度量算法

Efficient Algorithms for Measuring the Funnel-likeness of DAGs

Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge

摘要:

漏斗是DAG的一个新的天然亚类。直观地说,如果每个源-汇路径都可以由它的一个弧唯一标识,则DAG是漏斗。漏斗是有向图的树的类似物,它比DAG更具限制性,但比入/出树更具表达性。计算问题,如寻找顶点不相交的路径或跟踪模因的起源仍然是NP困难的DAG,而漏斗,他们成为解决多项式时间。我们的主要重点是找出一个给定的DAG是如何漏斗状的算法复杂性。为此,我们研究了NP-困难问题的计算弧删除距离的漏斗一个给定的DAG。我们为该问题开发了高效的精确算法和近似算法,并在合成随机图和真实世界图上测试了它们。

英文摘要:

Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funnel if every source-sink path can be uniquely identified by one of its arcs. Funnels are an analog to trees for directed graphs that is more restrictive than DAGs but more expressive than in-/out-trees. Computational problems such as finding vertex-disjoint paths or tracking the origin of memes remain NP-hard on DAGs while on funnels they become solvable in polynomial time. Our main focus is the algorithmic complexity of finding out how funnel-like a given DAG is. To this end, we study the NP-hard problem of computing the arc-deletion distance to a funnel of a given DAG. We develop efficient exact and approximation algorithms for the problem and test them on synthetic random graphs and real-world graphs.

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

↑