A backtracking algorithm to generate all kernels of a directed graph (Q3674074)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A backtracking algorithm to generate all kernels of a directed graph |
scientific article; zbMATH DE number 3829275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A backtracking algorithm to generate all kernels of a directed graph |
scientific article; zbMATH DE number 3829275 |
Statements
A backtracking algorithm to generate all kernels of a directed graph (English)
0 references
1981
0 references
directed graph
0 references
kernel
0 references
backtracking algorithm
0 references
