Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918)
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: Simple DFS on the complement of a graph and on partially complemented digraphs |
scientific article; zbMATH DE number 6633197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple DFS on the complement of a graph and on partially complemented digraphs |
scientific article; zbMATH DE number 6633197 |
Statements
Simple DFS on the complement of a graph and on partially complemented digraphs (English)
0 references
6 October 2016
0 references
depth-first search
0 references
graph algorithms
0 references
graph traversal
0 references
partially complemented digraphs
0 references
0 references
0.7538952231407166
0 references
0.7510911226272583
0 references
0.7491961121559143
0 references
