On finding the longest antisymmetric path in directed acyclic graphs (Q477694)
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 6378689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding the longest antisymmetric path in directed acyclic graphs |
scientific article; zbMATH DE number 6378689 |
Statements
On finding the longest antisymmetric path in directed acyclic graphs (English)
0 references
9 December 2014
0 references
computational complexity
0 references
lower bound
0 references
inapproximability
0 references
longest antisymmetric path
0 references
directed acyclic graphs
0 references
0 references
0 references
0 references
0.85039663
0 references
0 references
0.8415415
0 references
0.83773124
0 references
0.8372692
0 references
0 references
