An Algorithm for Finding the Influence Digraph of a Time-Stamped Graph
139 - 144
A time-stamped graph is a graph with multiple edges but no loops, where each edge is labeled with a time-stamp. A time-stamp is intended to represent the time of collaboration between the vertices joined by the edge. Given a time-stamped graph H, the assiciated influence digraph of H is the digraph on the vertex set of H with an arc from a to b iff there is a path from a to b in H which has non-decreasing time-stamps. We say that a influences b. In this paper we show the construction of an efficient algorithm for constructing the influence digraph of a time-stamped graph.
time-stamped graph, influence digraph, efficient algorithm
Discrete Mathematics and Combinatorics | Mathematics
Marc Lipman (2008).
An Algorithm for Finding the Influence Digraph of a Time-Stamped Graph. Congressus Numerantium.189, 139 - 144.
This document is currently not available here.