Subexponential algorithms for variants of homomorphism problem in string graphs

DOI10.1007/978-3-030-30786-8_1MaRDI QIDQ2301531zbMATH OpenOpenAlexFDO

Authors Karolina Okrasa, Paweł Rzążewski

Publication date 24 February 2020

Full work available at URL https://arxiv.org/abs/1809.09345

zbMATH Keywords

graph homomorphismsegment graphsstring graphssubexponential algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Subexponential algorithms for variants of the homomorphism problem in string graphs
• Lower bounds for the graph homomorphism problem
• Optimality program in segment and string graphs
• Optimality program in segment and string graphs
• Tight Bounds for Graph Homomorphism and Subgraph Isomorphism

Cited in

(2)

• Subexponential algorithms for variants of the homomorphism problem in string graphs
• Recognition and proper coloring of unit segment intersection graphs

This page was built for publication: Subexponential algorithms for variants of homomorphism problem in string graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301531)