A sensitive transitive closure algorithm (Q1156488): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(81)90026-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047783181 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5616735 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3902512 / 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: A Theorem on Boolean Matrices / rank | |||
Normal rank | |||
Latest revision as of 13:45, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sensitive transitive closure algorithm |
scientific article |
Statements
A sensitive transitive closure algorithm (English)
0 references
1981
0 references
reachability
0 references
depth-first closure
0 references
depth-first search
0 references
