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 this page instead for the normal view: Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs |
scientific article |
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
