Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs

Fichier principal
Vignette du fichier
LIPIcs-MFCS-2019-73.pdf (604.27 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-02335601 , version 1 (28-10-2019)

Identifiers

Cite

Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, et al.. Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1-14, ⟨10.4230/LIPIcs.MFCS.2019.73⟩. ⟨hal-02335601⟩
58 View
126 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More