CINECA IRIS Institutional Research Information System

Sfoglia per Autore  

Opzioni
Mostra risultati da 21 a 40 di 66
Titolo Data di pubblicazione Autore(i) File
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; 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
Efficient enumeration of subgraphs and induced subgraphs with bounded girth 1-gen-2018 Kurita, Kazuhiro; Wasa, Kunihiro; Conte, Alessio; Uno, Takeaki; Arimura, Hiroki
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph 1-gen-2018 Conte, A.; Kante, M. M.; Otachi, Y.; Uno, T.; Wasa, K.
Listing Subgraphs by Cartesian Decomposition 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca
Listing subgraphs by cartesian decomposition 1-gen-2018 Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; Versari, L.
Node Similarity with q-Grams for Real-World Labeled Networks 1-gen-2018 Conte, Alessio; Ferraro, Gaspare; Grossi, Roberto; Marino, Andrea; Sadakane, Kunihiko; Uno, Takeaki
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 1-gen-2019 Conte, Alessio; Grossi, Roberto; Marino, Andrea
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 1-gen-2019 Conte, A.; Grossi, R.; Kante, M. M.; Marino, A.; Uno, T.; Wasa, K.
Shared-nothing distributed enumeration of 2-plexes 1-gen-2019 Conte, A.; Patrignani, M.; Firmani, D.; Torlone, R.
New polynomial delay bounds for maximal subgraph enumeration by proximity search 1-gen-2019 Conte, A.; Uno, T.
Listing maximal subgraphs satisfying strongly accessible properties∗ 1-gen-2019 Conte, A.; Grossi, R.; Marino, A.; Versari, L.
A fast discovery algorithm for large common connected induced subgraphs 1-gen-2019 Conte, A.; Grossi, R.; Marino, A.; Tattini, L.; Versari, L.
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 1-gen-2019 Conte, A.; Kante, M. M.; Marino, A.; Uno, T.
Online Algorithms on Antipowers and Antiperiods 1-gen-2019 Alzamel, M.; Conte, A.; Greco, D.; Guerrini, Veronica; Iliopoulos, C.; Pisanti, N.; Prezza, N.; Punzi, Giulia; Rosone, G.
Polynomial-Delay Enumeration of Maximal Common Subsequences 1-gen-2019 Conte, A.; Grossi, R.; Punzi, G.; Uno, T.
Finding the Anticover of a String 1-gen-2020 Alzamel, M.; Conte, A.; Denzumi, S.; Grossi, R.; Iliopoulos, C. S.; Kurita, K.; Wasa, K.
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.
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 1-gen-2020 Conte, A.; Crescenzi, P.; Marino, A.; Punzi, G.
Large-scale clique cover of real-world networks 1-gen-2020 Conte, A.; Grossi, R.; Marino, A.
Mostra risultati da 21 a 40 di 66
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