CINECA IRIS Institutional Research Information System

Sfoglia per Autore  

Opzioni
Mostra risultati da 1 a 19 di 19
Titolo Data di pubblicazione Autore(i) File
Listing maximal independent sets with minimal space and bounded delay 1-gen-2017 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Uno, Takeaki; Versari, Luca
Measuring the clustering effect of BWT via RLE 1-gen-2017 Mantaci, Sabrina; Restivo, Antonio; Rosone, Giovanna; Sciortino, Marinella; Versari, Luca
A fast algorithm for large common connected induced subgraphs 1-gen-2017 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 1-gen-2018 Conte, Alessio; DE MATTEIS, Tiziano; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables 1-gen-2018 Grossi, Roberto; Versari, Luca
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs 1-gen-2018 Grossi, Roberto; Marino, Andrea; Versari, Luca
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Uno, Takeaki; Versari, Luca
Listing Subgraphs by Cartesian Decomposition 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca
Round_Hashing: Implementation of Round Hashing and benchmark 1-gen-2018 Grossi, Roberto; Versari, Luca
Listing subgraphs by cartesian decomposition 1-gen-2018 Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; Versari, L.
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 1-gen-2018 Conte, Alessio; DE MATTEIS, Tiziano; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Discovering K-Trusses in Large-Scale Networks 1-gen-2018 Conte, Alessio; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca
Listing maximal subgraphs satisfying strongly accessible properties∗ 1-gen-2019 Conte, A.; Grossi, R.; Marino, A.; Versari, L.
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 1-gen-2020 Conte, A.; Grossi, R.; Marino, A.; Versari, L.
Zuckerli: A New Compressed Representation for Graphs 1-gen-2020 Versari, L.; Comsa, I. -M.; Conte, A.; Grossi, R.
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 1-gen-2020 Conte, A.; De Sensi, D.; Grossi, R.; Marino, A.; Versari, L.
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 1-gen-2022 Conte, A; Grossi, R; Marino, A; Uno, T; Versari, L
Mostra risultati da 1 a 19 di 19
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile