MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Transitive Reduction of a Directed Graph." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

11 documents found, showing 1 through 10. Next 10 →

ATOM

Elimination Structures For Unsymmetric Sparse LU Factors
by John R. Gilbert, Joseph W. H. Liu — 1993 — SIAM J. Matrix Analysis and Applications
…. Elimination dags for sparse LU factorization. 3.1. Transitive reduction of a directed graph. Theorem 2…
Cited by 30 (3 self) – Add To MetaCart

Mining Process Models from Workflow Logs
by Rakesh Agrawal, Dimitrios Gunopulos, Frank Leymann — 1998
…. An additional problem is that in the case of a directed graph with cycles the transitive reduction operation…
Cited by 108 (1 self) – Add To MetaCart

A Machine Learning Approach to Workflow Management
by Joachim Herbst — 2000 — In Proceedings 11th European Conference on Machine Learning
… of a directed graph G is defined as a minimal subgraph of G having the same transitive closure as G…
Cited by 48 (0 self) – Add To MetaCart

Ordering, Anisotropy, And Factored Sparse Approximate Inverses
by Robert Bridson Wei-Pai, Wei-pai Tang, Ax B — SIAM J. Sci. Comput
… that were connected by a dipath u # # v in G. 2 The transitive reduction of a directed graph G is a…
Add To MetaCart

Anisotropy and Factored Sparse Approximate Inverses
by Robert Bridson, Wei-pai Tang — 1999 — SIAM J. Sci. Comput
… numerical information from the matrix 2 The transitive reduction of a directed graph G is a graph G…
Cited by 13 (5 self) – Add To MetaCart

Dealing with Concurrency in Workflow Induction
by Joachim Herbst — 2000 — European Concurrent Engineering Conference. SCS Europe
… of a directed graph G is defined as a minimal subgraph of G having the same transitive closure as G…
Cited by 14 (0 self) – Add To MetaCart

Optimal Tracing and Replay for Debugging Shared-Memory Parallel Programs
by Robert Netzer, Robert H. B. Netzer — 1993 — In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging (PADD
… instead provides sufficient information. The transitive reduction of a directed graph is a (unique) graph…
Cited by 43 (0 self) – Add To MetaCart

A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs
by E. N. Caceres, S. W. Song, J. L. Szwarcfiter, J. L. Szwarc Ter
… by transitivity. In other words, the transitive reduction of a directed graph G is the subgraph GR…
Add To MetaCart

Trace Size vs Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
by Robert H.B. Netzer, Robert H. B. Netzer — 1993 — of SharedMemory Programs,” Languages and Compilers for Parallel Computing, LNCS
… is all that is necessary.The transitive reduction of a directed graph is a (unique) graph with all edges…
Cited by 3 (0 self) – Add To MetaCart

Maintenance of Implication Integrity Constraints under Updates to Constraints
by Naci S. Ishakbeyoglu, Z. Meral Ozsoyoglu — 1993
… predicates either. Using the transitive reduction of a directed graph (Aho et al. 1972), a non…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB