Sciweavers

343 search results - page 1 / 69
» On Making Directed Graphs Transitive
Sort
View
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
13 years 11 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
JDA
2006
184views more  JDA 2006»
13 years 4 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
DAM
2008
109views more  DAM 2008»
13 years 5 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
ALGORITHMICA
2008
83views more  ALGORITHMICA 2008»
13 years 5 months ago
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
Réka Albert, Bhaskar DasGupta, Riccardo Don...
TCS
2008
13 years 4 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven