Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126434548, #quickstatements; #temporary_batch_1721910495864 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126434548 / rank | |||
Normal rank | |||
Latest revision as of 14:31, 25 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subexponential algorithms for variants of the homomorphism problem in string graphs |
scientific article |
Statements
Subexponential algorithms for variants of the homomorphism problem in string graphs (English)
0 references
24 February 2020
0 references
graph homomorphism
0 references
string graphs
0 references
segment graphs
0 references
subexponential algorithms
0 references
ETH
0 references
0 references
0 references
