A Fast Discovery Algorithm for Large Common Connected Induced Subgraphs - Archive ouverte HAL Access content directly
Conference Papers Year :

A Fast Discovery Algorithm for Large Common Connected Induced Subgraphs

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
Laccis_WEPA_special_DAM.pdf (746.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Marie-France Sagot  : Connect in order to contact the contributor

https://hal.inria.fr/hal-02338435

Submitted on : Wednesday, October 30, 2019-8:12:17 AM

Last modification on : Friday, March 24, 2023-2:53:13 PM

Download

Dates and versions

hal-02338435 , version 1 (30-10-2019)

Identifiers

  • HAL Id : hal-02338435 , version 1

Cite

Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari. A Fast Discovery Algorithm for Large Common Connected Induced Subgraphs. WEPA 2019 - Workshop on Enumeration Problems & Applications, Oct 2019, Awaji Island, Japan. pp.1-26. ⟨hal-02338435⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INRIA BAMBOO INRIA2 UNIV-COTEDAZUR
32 View
220 Download

Share

Gmail Facebook Twitter LinkedIn More