Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2005.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081923266 / rank | |||
Normal rank | |||
Revision as of 19:59, 19 March 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
