Mauro Mezzini

From MaRDI portal
Revision as of 04:34, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:266842

Available identifiers

zbMath Open mezzini.mauroMaRDI QIDQ266842

List of research outcomes





PublicationDate of PublicationType
An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs2022-03-22Paper
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs2018-09-24Paper
On the geodetic iteration number of the contour of a graph2016-05-02Paper
The contour of a bridged graph is geodetic2016-04-07Paper
On the geodeticity of the contour of a graph2014-12-05Paper
Computing simple-path convex hulls in hypergraphs2013-04-04Paper
CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT2013-01-24Paper
Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time2012-08-10Paper
Equivalence between hypergraph convexities2012-04-03Paper
Fast minimal triangulation algorithm using minimum degree criterion2011-07-14Paper
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network2010-03-09Paper
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs2010-03-09Paper
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time2009-01-19Paper
An analytical approach to the inference of summary data of additive type2007-10-18Paper
Minimal invariant sets in a vertex-weighted graph2006-10-20Paper
https://portal.mardi4nfdi.de/entity/Q44145302003-07-25Paper
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph2002-09-29Paper

Research outcomes over time

This page was built for person: Mauro Mezzini