Computational experiences with some transitive closure algorithms (Q1229720): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experiences with some transitive closure algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the transitive closure of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient determination of the transitive closure of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast expected time algorithm for Boolean matrix multiplication and transitive closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transitive closure algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4049111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing all paths in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank

Latest revision as of 19:31, 12 June 2024

scientific article
Language Label Description Also known as
English
Computational experiences with some transitive closure algorithms
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references