We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...