×
Author ID: mezzini.mauro Recent zbMATH articles by "Mezzini, Mauro"
Published as: Mezzini, Mauro; Mezzini, M.
External Links: ORCID
Documents Indexed: 17 Publications since 2002
Co-Authors: 2 Co-Authors with 10 Joint Publications
11 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

14 Publications have been cited 52 times in 37 Documents Cited by Year
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network. Zbl 1213.05251
Mezzini, Mauro; Moscarini, Marina
7
2010
Computing simple-path convex hulls in hypergraphs. Zbl 1259.05170
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina
7
2011
On the geodeticity of the contour of a graph. Zbl 1304.05027
Mezzini, Mauro; Moscarini, Marina
6
2015
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs. Zbl 1401.05285
Mezzini, Mauro
6
2018
Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent. Zbl 1257.05106
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina
5
2012
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs. Zbl 1213.05250
Mezzini, Mauro
4
2010
Equivalence between hypergraph convexities. Zbl 1238.05186
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina
4
2011
The contour of a bridged graph is geodetic. Zbl 1333.05098
Mezzini, Mauro; Moscarini, Marina
3
2016
On the geodetic iteration number of the contour of a graph. Zbl 1335.05049
Mezzini, Mauro
3
2016
Fast minimal triangulation algorithm using minimum degree criterion. Zbl 1220.05121
Mezzini, Mauro
2
2011
A linear algorithm for finding the invariant edges of an edge-weighted graph. Zbl 1001.05037
Malvestuto, F. M.; Mezzini, M.
2
2002
Minimal invariant sets in a vertex-weighted graph. Zbl 1100.68082
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina
1
2006
Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time. Zbl 1246.68173
Mezzini, Mauro
1
2012
Auditing sum queries. Zbl 1022.68036
Malvestuto, Francesco M.; Mezzini, Mauro
1
2003
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs. Zbl 1401.05285
Mezzini, Mauro
6
2018
The contour of a bridged graph is geodetic. Zbl 1333.05098
Mezzini, Mauro; Moscarini, Marina
3
2016
On the geodetic iteration number of the contour of a graph. Zbl 1335.05049
Mezzini, Mauro
3
2016
On the geodeticity of the contour of a graph. Zbl 1304.05027
Mezzini, Mauro; Moscarini, Marina
6
2015
Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent. Zbl 1257.05106
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina
5
2012
Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time. Zbl 1246.68173
Mezzini, Mauro
1
2012
Computing simple-path convex hulls in hypergraphs. Zbl 1259.05170
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina
7
2011
Equivalence between hypergraph convexities. Zbl 1238.05186
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina
4
2011
Fast minimal triangulation algorithm using minimum degree criterion. Zbl 1220.05121
Mezzini, Mauro
2
2011
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network. Zbl 1213.05251
Mezzini, Mauro; Moscarini, Marina
7
2010
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs. Zbl 1213.05250
Mezzini, Mauro
4
2010
Minimal invariant sets in a vertex-weighted graph. Zbl 1100.68082
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina
1
2006
Auditing sum queries. Zbl 1022.68036
Malvestuto, Francesco M.; Mezzini, Mauro
1
2003
A linear algorithm for finding the invariant edges of an edge-weighted graph. Zbl 1001.05037
Malvestuto, F. M.; Mezzini, M.
2
2002

Citations by Year