"The Fine-Grained Complexity of Graph Homomorphism Parameterized by ..."

Robert Ganian et al. (2024)

> Home

Details and statistics

DOI: 10.1145/3652514

access: closed

type: Journal Article

metadata version: 2024-07-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/GanianHKOS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/GanianHKOS24
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20(3): 19 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.