The following pages link to Mauro Mezzini (Q266842):
Displaying 17 items.
- The contour of a bridged graph is geodetic (Q266844) (← links)
- On the geodetic iteration number of the contour of a graph (Q277655) (← links)
- Equivalence between hypergraph convexities (Q410668) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- On the geodeticity of the contour of a graph (Q479045) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Computing simple-path convex hulls in hypergraphs (Q1944079) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- An analytical approach to the inference of summary data of additive type (Q2456376) (← links)
- Minimal invariant sets in a vertex-weighted graph (Q2508971) (← links)
- A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph (Q3149876) (← links)
- (Q4414530) (← links)
- CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT (Q4903647) (← links)
- Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time (Q5301414) (← links)
