An efficient transitive closure algorithm for cyclic digraphs (Q1341684): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A sensitive transitive closure algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On computing the transitive closure of a relation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The transitive closure of a random digraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finding the strongly connected components in a directed graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A transitive closure algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved transitive closure algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank |
Latest revision as of 10:13, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient transitive closure algorithm for cyclic digraphs |
scientific article |
Statements
An efficient transitive closure algorithm for cyclic digraphs (English)
0 references
21 June 2000
0 references