期刊
THEORETICAL COMPUTER SCIENCE
卷 457, 期 -, 页码 1-9出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2012.07.023
关键词
Maximal DAG; Feedback arc set; Story arc set
资金
- French project ANR MIRI [BLAN08-1335497]
- French project ANR NEMO BLAN08-1318829
- ERC Advanced Grant SISYPHE
- INRIA associate team SIMBIOSI
- NWO-CLS MEMESA project
- DISCO PRIN National Research Project
- Tinbergen Institute
We present a constrained version of the problem of enumerating all maximal directed acyclic subgraphs (DAG) of a graph G. In this version, we enumerate maximal DAGs whose sources and targets belong to a predefined subset of the nodes. We call such DAGs stories. We first show how to compute one story in polynomial-time, and then describe two different algorithms to tell all possible stories. (C) 2012 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据