Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits. (Q610000)
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: Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits. |
scientific article; zbMATH DE number 5822486
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits. |
scientific article; zbMATH DE number 5822486 |
Statements
Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits. (English)
0 references
1 December 2010
0 references
