Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:01, 3 February 2024
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