Pages that link to "Item:Q1944079"
From MaRDI portal
The following pages link to Computing simple-path convex hulls in hypergraphs (Q1944079):
Displaying 7 items.
- Equivalence between hypergraph convexities (Q410668) (← links)
- On the geodeticity of the contour of a graph (Q479045) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- On the contour of graphs (Q2446313) (← links)
- CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT (Q4903647) (← links)
- A new notion of convexity in digraphs with an application to Bayesian networks (Q5347248) (← links)
