Counting subgraphs in somewhere dense graphs
From MaRDI portal
Publication:6621747
DOI10.1137/22M1535668MaRDI QIDQ6621747
Leslie Ann Goldberg, Marc Roth, Marco Bressan, Kitty Meeks
Publication date: 21 October 2024
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: Counting subgraphs in somewhere dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621747)
