Efficiently listing bounded length st-paths

Romeo Rizzi 1 Gustavo Sacomoto 2, 3 Marie-France Sagot 3, 2
1 DIMI - Dipartimento di Matematica e Informatica - Universita Udine
2 Baobab
PEGASE - Département PEGASE [LBBE]
3 BAMBOO - An algorithmic view on genomes, cells, and environments
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/hal-01091924
Contributor : Marie-France Sagot <>
Submitted on : Sunday, December 7, 2014 - 7:40:49 PM
Last modification on : Thursday, November 21, 2019 - 1:14:06 PM

Links full text

arxiv

Identifiers

  • HAL Id : hal-01091924, version 1
  • ARXIV : 1411.6852

Collections

CNRS | INRIA | BAMBOO | BIOENVIS | UNIV-LYON1 | UDL

Citation

Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot. Efficiently listing bounded length st-paths. Twenty-Fifth International Workshop on Combinatorial Algorithms (IWOCA 2014), Sep 2014, Duluth, Minnesota, France. in press. ⟨hal-01091924⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

237

 

 

Contact

archive-ouverte@inria.fr