Computing simple-path convex hulls in hypergraphs

Characteristic Properties and Recognition of Graphs in Which Geodesic and Monophonic Convexities Are Equivalent

“…Fagin [7] introduced four notions of hypergraph acyclicity which prove to be relevant in the study of convexity in hypergraphs [16,18,19]. We now recall the definitions of α-acyclic and γ-acyclic hypergraphs.…”

An O(mn2) algorithm for computing the strong geodetic number in outerplanar graphs

“…Given two vertices u and v of a graph, a geodesic is a shortest path between u and v. The interval of a pair of vertices u and v of G, denoted by I G [u, v], is the set of all vertices that lie on some geodesic between u and v [14,16,19]. The interval of a set of vertices S, I G [S], is the union of the intervals between pairs of vertices of S, taken over all pairs of vertices in S.…”

An Algorithm for Counting the Fixed Point Orbits of an AND-OR Dynamical System with Symmetric Positive Dependency Graph

“…In this paper, we present an algorithm for counting the FPOs in an AND-OR symmetric positive PDS. The algorithm has been designed by using more or less standard methodologies (such as the one used also in [14][15][16][17][18][19][20][21][22][23]) and by using both a greedy strategy and recursion. The paper is organized as follows.…”