Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
From MaRDI portal
Publication:6655672
DOI10.1016/j.jcss.2024.103600MaRDI QIDQ6655672
Jesper Nederlof, Krisztina Szilágyi
Publication date: 27 December 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
