On the complexity of recognizing directed path families (Q967290)
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 5702567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of recognizing directed path families |
scientific article; zbMATH DE number 5702567 |
Statements
On the complexity of recognizing directed path families (English)
0 references
28 April 2010
0 references
directed line graph
0 references
hypergraph 2-colorability
0 references
recognition algorithms
0 references
directed path family
0 references
0 references
0.731673002243042
0 references
0.7271201014518738
0 references
0.7231807112693787
0 references
0.7083661556243896
0 references
0.707778811454773
0 references
