A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...
Alice Devillers, Michael Giudici, Cai Heng Li, Che...
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...