Sfoglia per Autore
Enumerating Cyclic Orientations of a Graph
2015-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques
2016-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca
Clique covering of large real-world networks
2016-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea
Finding all maximal cliques in very large social networks
2016-01-01 Conte, Alessio; De Virgilio, Roberto; Maccioni, Antonio; Patrignani, Maurizio; Torlone, Riccardo
Listing acyclic orientations of graphs with single and multiple sources
2016-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo
Directing road networks by listing strong orientations
2016-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph
2017-01-01 Conte, Alessio; Kanté, Mamadou Moustapha; Otachi, Yota; Uno, Takeaki; Wasa, Kunihiro
Efficiently Clustering Very Large Attributed Graphs
2017-01-01 Baroni, Alessandro; Conte, Alessio; Patrignani, Maurizio; Ruggieri, Salvatore
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs
2017-01-01 Conte, Alessio; Kurita, Kazuhiro; Wasa, Kunihiro; Uno, Takeaki
Fast enumeration of large k-Plexes
2017-01-01 Conte, Alessio; Firmani, Donatella; Mordente, Caterina; Patrignani, Maurizio; Torlone, Riccardo
A fast algorithm for large common connected induced subgraphs
2017-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca
On maximal cliques with connectivity constraints in directed graphs
2017-01-01 Conte, Alessio; Kanté, Mamadou Moustapha; Uno, Takeaki; Wasa, Kunihiro
Listing maximal independent sets with minimal space and bounded delay
2017-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Uno, Takeaki; Versari, Luca
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts
2018-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Uno, Takeaki; Versari, Luca
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs
2018-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes
2018-01-01 Conte, Alessio; DE MATTEIS, Tiziano; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Listing subgraphs by cartesian decomposition
2018-01-01 Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; Versari, L.
Listing Subgraphs by Cartesian Decomposition
2018-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick
2018-01-01 Conte, Alessio; Ferraro, Gaspare; Grossi, Roberto; Marino, Andrea; Sadakane, Kunihiko; Uno, Takeaki
Discovering K-Trusses in Large-Scale Networks
2018-01-01 Conte, Alessio; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Enumerating Cyclic Orientations of a Graph | 1-gen-2015 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo | |
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques | 1-gen-2016 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca | |
Clique covering of large real-world networks | 1-gen-2016 | Conte, Alessio; Grossi, Roberto; Marino, Andrea | |
Finding all maximal cliques in very large social networks | 1-gen-2016 | Conte, Alessio; De Virgilio, Roberto; Maccioni, Antonio; Patrignani, Maurizio; Torlone, Riccardo | |
Listing acyclic orientations of graphs with single and multiple sources | 1-gen-2016 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo | |
Directing road networks by listing strong orientations | 1-gen-2016 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca | |
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph | 1-gen-2017 | Conte, Alessio; Kanté, Mamadou Moustapha; Otachi, Yota; Uno, Takeaki; Wasa, Kunihiro | |
Efficiently Clustering Very Large Attributed Graphs | 1-gen-2017 | Baroni, Alessandro; Conte, Alessio; Patrignani, Maurizio; Ruggieri, Salvatore | |
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs | 1-gen-2017 | Conte, Alessio; Kurita, Kazuhiro; Wasa, Kunihiro; Uno, Takeaki | |
Fast enumeration of large k-Plexes | 1-gen-2017 | Conte, Alessio; Firmani, Donatella; Mordente, Caterina; Patrignani, Maurizio; Torlone, Riccardo | |
A fast algorithm for large common connected induced subgraphs | 1-gen-2017 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca | |
On maximal cliques with connectivity constraints in directed graphs | 1-gen-2017 | Conte, Alessio; Kanté, Mamadou Moustapha; Uno, Takeaki; Wasa, Kunihiro | |
Listing maximal independent sets with minimal space and bounded delay | 1-gen-2017 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Uno, Takeaki; 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 | |
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 | |
Listing subgraphs by cartesian decomposition | 1-gen-2018 | Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; Versari, L. | |
Listing Subgraphs by Cartesian Decomposition | 1-gen-2018 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca | |
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick | 1-gen-2018 | Conte, Alessio; Ferraro, Gaspare; Grossi, Roberto; Marino, Andrea; Sadakane, Kunihiko; Uno, Takeaki | |
Discovering K-Trusses in Large-Scale Networks | 1-gen-2018 | Conte, Alessio; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca |
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