An Algorithm for Finding a Minimal Equivalent Graph of a Digraph (Q4075493): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/321864.321866 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1981358946 / rank | |||
Normal rank |
Latest revision as of 00:23, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Algorithm for Finding a Minimal Equivalent Graph of a Digraph |
scientific article |
Statements
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph (English)
0 references
1975
0 references