Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
- 期刊名称Theoretical Computer Science
- 作者Acuña, Vicente; Birmelé, Etienne; Cottret, Ludovic; Crescenzi, Pierluigi; Jourdan, Fabien; Lacroix, Vincent; Marchetti-Spaccamela, Alberto; Marino, Andrea; Milreu, Paulo Vieira; Sagot, Marie-France; Stougie, Leen
- 卷第457卷
- 印刷ISSN0304-3975
- 文件大小335.05KB
- 发表时间2012-10
- DOI10.1016/j.tcs.2012.07.023
- 页码1-9
P automata revisitedPăun, Gheorghe; Pérez-Jiménez, Mario J. · Theoretical Computer Science · 2012
Consistency of multidimensional combinatorial substitutionsJolivet, Timo; Kari, Jarkko · Theoretical Computer Science · 2012
Quantum counterfeit coin problemsIwama, Kazuo; Nishimura, Harumichi; Raymond, Rudy; Teruyama, Junichi · Theoretical Computer Science · 2012
Reversible iterative graph processesDourado, Mitre C.; Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme L. · Theoretical Computer Science · 2012
Lowness for bounded randomnessDowney, Rod; Ng, Keng Meng · Theoretical Computer Science · 2012
Lower bound for balanced setsNedev, Zhivko · Theoretical Computer Science · 2012
The lattice structure of -player gamesCincotti, Alessandro · Theoretical Computer Science · 2012
Chordal digraphsMeister, Daniel; Telle, Jan Arne · Theoretical Computer Science · 2012