A New Algorithm for Computing the Maximal Closure of a Graph (Q3491289): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:15, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Algorithm for Computing the Maximal Closure of a Graph |
scientific article |
Statements
A New Algorithm for Computing the Maximal Closure of a Graph (English)
0 references
1990
0 references
directed graph
0 references
maximal closure problem
0 references
equivalent maximal flow problem
0 references
