On computing graph closures (Q1120287): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4128417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum flow problem is log space complete for P / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dioïds and semirings: Links to fuzzy sets and other applications / rank | |||
Normal rank | |||
Latest revision as of 15:19, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing graph closures |
scientific article |
Statements
On computing graph closures (English)
0 references
1989
0 references
P-completeness
0 references
graphs
0 references
closure
0 references
