Enumerating the kernels of a directed graph with no odd circuits (Q1332748)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 633499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating the kernels of a directed graph with no odd circuits |
scientific article; zbMATH DE number 633499 |
Statements
Enumerating the kernels of a directed graph with no odd circuits (English)
0 references
19 September 1995
0 references
computational complexity
0 references
directed graph
0 references
kernels
0 references
0 references
0.8018833994865417
0 references
0.8004632592201233
0 references
0.8004274368286133
0 references
0.7816962003707886
0 references
