Sfoglia per Autore
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound
2010 P. Crescenzi; R. Grossi; C. Imbrenda; L. Lanzi; A. Marino
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
2010 P. Crescenzi; M. Di Ianni; A. Marino; G. Rossi; P. Vocca
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs
2011 P. Crescenzi; R. Grossi; L. Lanzi; A. Marino
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
2011 P. Crescenzi; D. Gildea; A. Marino; G. Rossi; G. Satta
Smooth movement and Manhattan path based random waypoint mobility
2011 P. Crescenzi; M. Di Ianni; A. Marino; D. Merlini; G. Rossi; P. Vocca
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
2012 Vicente Acuña;Etienne Birmelé;Ludovic Cottret;Pierluigi Crescenzi;Fabien Jourdan;Vincent Lacroix;Alberto Marchetti-Spaccamela;Andrea Marino;Paulo Vieira Milreu;Marie-France Sagot;Leen Stougie
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS
2012 P. CRESCENZI; R. GROSSI; L. LANZI; A. MARINO
Efficient Bubble Enumeration in Directed Graphs
2012 Etienne Birmelé;Pierluigi Crescenzi;Rui Ferreira;Roberto Grossi;Vincent Lacroix;Andrea Marino;Nadia Pisanti;Gustavo Sacomoto;Marie-France Sagot
Topical clustering of search results
2012 U. Scaiella; P. Ferragina; A. Marino; M. Ciaramita
Structural and dynamical analysis of biological networks
2012 Klein, Cecilia; MARINO, ANDREA; Sagot, Marie France; Milreu, Paulo Vieira; Brilli, Matteo
Algorithms for Biological Graphs: Analysis and Enumeration
2013 Andrea Marino
Telling Stories Fast
2013 M. Borassi;P. Crescenzi;V. Lacroix;A. Marino;M.-F. Sagot;P. Vieira Milreu
On computing the diameter of real-world undirected graphs
2013 P. Crescenzi; R. Grossi; M. Habib; L. Lanzi; A. Marino
Optimal Listing of Cycles and st-Paths in Undirected Graphs
2013 BIRMELE E.; FERREIRA R.; GROSSI, ROBERTO; MARINO, ANDREA; PISANTI, NADIA; RIZZI R. SACOMOTO G. A.
Entity-linking via graph-distanceminimization
2014 Blanco, Roi; Boldi, Paolo; MARINO, ANDREA
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure
2014 P. V. Milreu;C. C. Klein;L. Cottret;V. Acuna;E. Birmele;M. Borassi;C. Junot;A. Marchetti-Spaccamela;A. Marino;L. Stougie;F. Jourdan;P. Crescenzi;V. Lacroix;M.-F. Sagot
Blind image clustering based on the Normalized Cuts criterion for camera identification
2014 I. Amerini; R. Caldelli; P. Crescenzi; A. Del Mastio; A. Marino
BUbiNG: Massive crawling for the masses
2014 Boldi, Paolo; Marino, Andrea; Santini, Massimo; Vigna, Sebastiano
On the Solvability of the Six Degrees of Kevin Bacon Game
2014 M. Borassi;P. Crescenzi;M. Habib;W. Kosters;A. Marino;F. Takes
Algorithms for Biological Graphs: Analysis and Enumeration
2014 Marino A
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound | 2010 | P. Crescenzi; R. Grossi; C. Imbrenda; L. Lanzi; A. Marino | |
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. | 2010 | P. Crescenzi; M. Di Ianni; A. Marino; G. Rossi; P. Vocca | |
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs | 2011 | P. Crescenzi; R. Grossi; L. Lanzi; A. Marino | |
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems | 2011 | P. Crescenzi; D. Gildea; A. Marino; G. Rossi; G. Satta | |
Smooth movement and Manhattan path based random waypoint mobility | 2011 | P. Crescenzi; M. Di Ianni; A. Marino; D. Merlini; G. Rossi; P. Vocca | |
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets | 2012 | Vicente Acuña;Etienne Birmelé;Ludovic Cottret;Pierluigi Crescenzi;Fabien Jourdan;Vincent Lacroix;Alberto Marchetti-Spaccamela;Andrea Marino;Paulo Vieira Milreu;Marie-France Sagot;Leen Stougie | |
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS | 2012 | P. CRESCENZI; R. GROSSI; L. LANZI; A. MARINO | |
Efficient Bubble Enumeration in Directed Graphs | 2012 | Etienne Birmelé;Pierluigi Crescenzi;Rui Ferreira;Roberto Grossi;Vincent Lacroix;Andrea Marino;Nadia Pisanti;Gustavo Sacomoto;Marie-France Sagot | |
Topical clustering of search results | 2012 | U. Scaiella; P. Ferragina; A. Marino; M. Ciaramita | |
Structural and dynamical analysis of biological networks | 2012 | Klein, Cecilia; MARINO, ANDREA; Sagot, Marie France; Milreu, Paulo Vieira; Brilli, Matteo | |
Algorithms for Biological Graphs: Analysis and Enumeration | 2013 | Andrea Marino | |
Telling Stories Fast | 2013 | M. Borassi;P. Crescenzi;V. Lacroix;A. Marino;M.-F. Sagot;P. Vieira Milreu | |
On computing the diameter of real-world undirected graphs | 2013 | P. Crescenzi; R. Grossi; M. Habib; L. Lanzi; A. Marino | |
Optimal Listing of Cycles and st-Paths in Undirected Graphs | 2013 | BIRMELE E.; FERREIRA R.; GROSSI, ROBERTO; MARINO, ANDREA; PISANTI, NADIA; RIZZI R. SACOMOTO G. A. | |
Entity-linking via graph-distanceminimization | 2014 | Blanco, Roi; Boldi, Paolo; MARINO, ANDREA | |
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure | 2014 | P. V. Milreu;C. C. Klein;L. Cottret;V. Acuna;E. Birmele;M. Borassi;C. Junot;A. Marchetti-Spaccamela;A. Marino;L. Stougie;F. Jourdan;P. Crescenzi;V. Lacroix;M.-F. Sagot | |
Blind image clustering based on the Normalized Cuts criterion for camera identification | 2014 | I. Amerini; R. Caldelli; P. Crescenzi; A. Del Mastio; A. Marino | |
BUbiNG: Massive crawling for the masses | 2014 | Boldi, Paolo; Marino, Andrea; Santini, Massimo; Vigna, Sebastiano | |
On the Solvability of the Six Degrees of Kevin Bacon Game | 2014 | M. Borassi;P. Crescenzi;M. Habib;W. Kosters;A. Marino;F. Takes | |
Algorithms for Biological Graphs: Analysis and Enumeration | 2014 | Marino A |
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