Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815)
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 5038124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs |
scientific article; zbMATH DE number 5038124 |
Statements
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (English)
0 references
30 June 2006
0 references
vertex-weighted digraphs
0 references
quasi-transitive digraphs
0 references
minimum cost cycles
0 references
0 references
0.8240901827812195
0 references
0.8116735219955444
0 references
0.8116735219955444
0 references
0.8049424886703491
0 references
