An algorithm for finding the essential sets of arcs of certain graphs (Q2533378): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users 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.1016/0095-8956(71)90053-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033661926 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5181724 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Généralisation de l'algorithme de Warshall / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on a Generalization of Boolean Matrix Theory / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:12, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding the essential sets of arcs of certain graphs |
scientific article |
Statements
An algorithm for finding the essential sets of arcs of certain graphs (English)
0 references
1971
0 references
topology
0 references
