A New Algorithm for Computing the Maximal Closure of a Graph (Q3491289): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.36.3.315 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963504164 / rank | |||
Normal rank | |||
Latest revision as of 22:42, 19 March 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
