Skip to Main content Skip to Navigation
Conference papers

Telling Stories Fast

Abstract : This paper presents a linear-time delay algorithm for enumerating all directed acyclic subgraphs of a directed graph G(V,E) that have their sources and targets included in two subsets S and T of V, respectively. From these subgraphs, called pitches, the maximal ones, called stories, may be extracted in a dramatically more efficient way in relation to a previous story telling algorithm. The improvement may even increase if a pruning technique is further applied that avoids generating many pitches which have no chance to lead to a story. We experimentally demonstrate these statements by making use of a quite large dataset of real metabolic pathways and networks.
Complete list of metadata
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Tuesday, June 18, 2013 - 11:14:01 AM
Last modification on : Thursday, January 20, 2022 - 4:13:29 PM


  • HAL Id : hal-00835201, version 1



Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, et al.. Telling Stories Fast. 12th International Symposium Experimental Algorithms (SEA), Jun 2013, Rome, Italy. pp.200-211. ⟨hal-00835201⟩



Record views