On digraphs with no two disjoint directed cycles (Q1092919)
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: On digraphs with no two disjoint directed cycles |
scientific article; zbMATH DE number 4021174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On digraphs with no two disjoint directed cycles |
scientific article; zbMATH DE number 4021174 |
Statements
On digraphs with no two disjoint directed cycles (English)
0 references
1987
0 references
configurations
0 references
2-connected digraphs
0 references
algorithm
0 references
disjoint dicycles
0 references
NP- complete
0 references
0.9233518
0 references
0.9227937
0 references
0 references
0.91888547
0 references
0.91009074
0 references
0.9096446
0 references
0 references
0.9093435
0 references
0.90693057
0 references
0 references
