Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph (Q1816346)
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: Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph |
scientific article; zbMATH DE number 949087
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph |
scientific article; zbMATH DE number 949087 |
Statements
Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph (English)
0 references
20 January 1997
0 references
branch-and-bound algorithms
0 references