The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147)
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: The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops |
scientific article; zbMATH DE number 5703734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops |
scientific article; zbMATH DE number 5703734 |
Statements
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (English)
0 references
5 May 2010
0 references
semicomplete digraphs
0 references
homomorphisms
0 references
minimum cost homomorphisms
0 references
dichotomy
0 references
0 references
0.9299439787864684
0 references
0.9277423024177552
0 references
0.9019896984100342
0 references
0.8997721076011658
0 references
0.8982013463973999
0 references
