Counting subgraphs in somewhere dense graphs

Bressan, M., Goldberg, L. A., Meeks, K. and Roth, M. (2024) Counting subgraphs in somewhere dense graphs. SIAM Journal on Computing, (Accepted for Publication)

[img] Text
324594.pdf - Accepted Version
Restricted to Repository staff only

607kB

Item Type:Articles
Additional Information:This research was funded in whole, or in part, by EPSRC grant EP/V032305/1.
Keywords:Counting problems, somewhere dense graphs, parameterised complexity theory.
Status:Accepted for Publication
Refereed:Yes
Glasgow Author(s) Enlighten ID:Meeks, Dr Kitty
Authors: Bressan, M., Goldberg, L. A., Meeks, K., and Roth, M.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:SIAM Journal on Computing
Publisher:Society for Industrial and Applied Mathematics
ISSN:0097-5397
ISSN (Online):1095-7111

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
312197Beyond One Solution in Combinatorial OptimisationKitty MeeksEngineering and Physical Sciences Research Council (EPSRC)EP/V032305/1Computing Science