# Transitive reduction

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- J. Complex Networks
- 2015

In many complex networks the vertices are ordered in time, and edges represent causal connections. We propose methods ofâ€¦Â (More)

Is this relevant?

2011

2011

- J. Artif. Intell. Res.
- 2011

Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, inâ€¦Â (More)

Is this relevant?

2010

2010

- Bioinformatics
- 2010

MOTIVATION
Distinguishing direct from indirect influences is a central issue in reverse engineering of biological networksâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- ASPLOS
- 2006

Now at VMware. Multithreaded deterministic replay has important applications in cyclic debugging, fault tolerance and intrusionâ€¦Â (More)

Is this relevant?

2005

2005

- The IEEE/WIC/ACM International Conference on Webâ€¦
- 2005

In this paper, we will show that transitive reduction can be used in real, large social networks analysis. Transitive reductionâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Discrete Mathematics
- 1999

A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, orâ€¦Â (More)

Is this relevant?

1993

1993

- Discrete Mathematics
- 1993

Habib, H., M. Morvan and J.-X. Rampon, On the calculation of transitive reduction-closure of orders, Discrete Mathematics 111â€¦Â (More)

Is this relevant?

1984

1984

- Discrete Applied Mathematics
- 1984

Boolean matrices are widely used in many fields, and the theory of boolean matrices is related to the algebra of relationsâ€¦Â (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- Proceedings of the Royal Society of Londonâ€¦
- 1980

A theory of edge detection is presented. The analysis proceeds in two parts. (1) Intensity changes, which occur in a naturalâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- SIAM J. Comput.
- 1972

We consider economical representations for the path information in a directed graph. A directed graph G is said to be aâ€¦Â (More)

Is this relevant?