Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman. The transitive reduction of a directed graph. SIAM J. Comput, 1(2), pages 131--137, 1972. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Privilege Administration For The Role Graph Model - Cecilia Ionita And (Correct)
A Parallel Algorithm For Transitive Closure - Cáceres, Song (Correct)
A Parallel Algorithm for Transitive Closure - Caceres, Song (Correct)
A Graph-Theoretic Approach to Efficiently Reason about.. - Franceschet, Montanari (2002) (Correct)
A graph-theoretic approach to efficiently reason about.. - Franceschet, Montanari (Correct)
Maintenance Of Transitive Closures And Transitive.. - Poutré, van Leeuwen (1987) (25 citations) (Correct)
Principal Type Schemes for Functional Programs with Overloading.. - Smith (1994) (34 citations) (Correct)
ArchE: A Graph Drawing System for Archaeology - Christoph Hundack Petra (1997) (Correct)
An Efficient Algorithm for the Configuration.. - Althaus, Duchier, .. (Correct)
Transitive Signature Schemes - Micali, Rivest (2002) (12 citations) (Correct)
Approximating the Minimum Equivalent Digraph - Khuller, RAGHAVACHARI, YOUNG (1995) (11 citations) (Correct)
On Strongly Connected Digraphs with Bounded Cycle Length - Khuller, Raghavachari, Young (1996) (9 citations) (Correct)
Linear Time Recognition Algorithm for Distributive Lattices - Habib, Nourine (1998) (Correct)
Spanning k-arc-strong Subdigraphs with few arcs in.. - Bang-Jensen, Huang, Yeo (2001) (Correct)
Strongly Connected Spanning Subgraphs with the Minimum.. - Bang-Jensen, Huang, Yeo (2000) (Correct)
Modeling UNIX Access Control with a Role Graph - Hua, Osborn (1998) (1 citation) (Correct)
A Graph Parsing Algorithm and Implementation - McCreary, Reed (1993) (Correct)
Preserving and Using Context Information in.. - Peterson, Buchholz.. (1989) (190 citations) (Correct)
Justified Plans and Ordered Hierarchies - Eugene Fink In (Correct)
A Survey of Sequential and Systolic Algorithms for the Algebraic.. - Fink (1992) (4 citations) (Correct)
Reachability Substitutes for Planar Digraphs - Katriel, Kutz, Skutella (2005) (Correct)
A Polynomial-Time Fragment of Dominance Constraints - Koller, Mehlhorn, Niehren (2000) (3 citations) (Correct)
Foundations of Semantic Web Databases - Carlos (2004) (1 citation) (Correct)
Computing Unique Canonical Covers for Simple FDs via.. - Lechtenbörger (Correct)
Strongly Connected Spanning Subgraphs With the Minimum.. - Bang-Jensen, Yeo (2000) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC