article

An algorithm for transitive reduction of an acyclic graph

Authors:
D. Gries

Cornell Univ., Ithaca, NY

Cornell Univ., Ithaca, NY
View Profile

,
A. J. Martin

California Institute of Technology, Pasadena, CA

California Institute of Technology, Pasadena, CA
View Profile

,
J. L. van de Snepscheut

Groningen Univ., Groningen, The Netherlands

Groningen Univ., Groningen, The Netherlands
View Profile

,
J. T. Udding

Groningen Univ., Groningen, The Netherlands

Groningen Univ., Groningen, The Netherlands
View Profile

Authors Info & Claims

Science of Computer Programming Volume 12 Issue 2July 1989pp 151–155https://doi.org/10.1016/0167-6423(89)90039-7

Published:01 July 1989Publication History

Science of Computer Programming

Abstract

No abstract available.

Index Terms

An algorithm for transitive reduction of an acyclic graph
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Computational complexity and cryptography
    1. Problems, reductions and completeness

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Published in
Science of Computer Programming Volume 12, Issue 2
July 1989
61 pages
ISSN:0167-6423
Editor:
M. Sintzoff
Univ. Catholique de Louvain, Louvain, Belgium
Issue’s Table of Contents
Sponsors
In-Cooperation
Publisher
Elsevier North-Holland, Inc.
United States
Publication History
- Published: 1 July 1989
Qualifiers
- article
Conference
Funding Sources
Other Metrics
View Article Metrics

Article Metrics
- 1
  Total Citations
  View Citations
- 0
  Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
View Author Metrics
Cited By
View all

View Issue’s Table of Contents