Subexponential algorithms for variants of homomorphism problem in string graphs (Q2301531)
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 7173286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential algorithms for variants of homomorphism problem in string graphs |
scientific article; zbMATH DE number 7173286 |
Statements
Subexponential algorithms for variants of homomorphism problem in string graphs (English)
0 references
24 February 2020
0 references
graph homomorphism
0 references
subexponential algorithm
0 references
string graphs
0 references
segment graphs
0 references
0.9717604517936708
0 references
0.800804853439331
0 references
0.7767295241355896
0 references
0.7766520380973816
0 references
0.7741604447364807
0 references
