Parameterised and fine-grained subgraph counting, modulo 2

Parameterised and fine-grained subgraph counting, modulo 2

Show other versions (1)

Given a class of graphs ℋ, the problem ⊕Sub(ℋ) is defined as follows. The input is a graph H ∈ ℋ together with an arbitrary graph G. The problem is to compute, modulo 2, the number of subgraphs of G that are isomorphic to H. The goal of this research is to determine for which classes ℋ the problem ⊕...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Goldberg, L, Roth, M
Format:	Conference item
Sprog:	English
Udgivet:	Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023

Lignende værker

Parameterised and fine-grained subgraph counting, modulo 2
af: Goldberg, LA, et al.
Udgivet: (2023)

Counting homomorphisms to K4-minor-free graphs, modulo 2
af: Focke, J, et al.
Udgivet: (2021)

Counting subgraphs in somewhere dense graphs
af: Bressan, M, et al.
Udgivet: (2023)

Counting subgraphs in somewhere dense graphs
af: Bressan, M, et al.
Udgivet: (2024)

Counting homomorphisms to K4-minor-free graphs, modulo 2
af: Focke, J, et al.
Udgivet: (2021)

Counting Homomorphisms to Square-Free Graphs, Modulo 2
af: Gobel, A, et al.
Udgivet: (2015)

The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2
af: Göbel, A, et al.
Udgivet: (2013)

Counting homomorphisms to square-free graphs, modulo 2
af: Goldberg, L, et al.
Udgivet: (2016)

The complexity of pattern counting in directed graphs, parameterised by the outdegree
af: Bressan, M, et al.
Udgivet: (2023)

Counting small induced subgraphs with hereditary properties
af: Focke, J, et al.
Udgivet: (2022)

Counting small induced subgraphs satisfying monotone properties
af: Roth, M, et al.
Udgivet: (2021)

Counting small induced subgraphs satisfying monotone properties
af: Roth, M, et al.
Udgivet: (2022)

Counting induced subgraphs: An algebraic approach to #W[1]-hardness
af: Dörfler, J, et al.
Udgivet: (2021)

Counting induced subgraphs: an algebraic approach to #W[1]-hardness
af: Dörfler, J, et al.
Udgivet: (2019)

Counting induced subgraphs: A topological approach to #W[1]-hardness
af: Roth, M, et al.
Udgivet: (2020)

Counting induced subgraphs: a topological approach to #W[1]-hardness
af: Roth, M, et al.
Udgivet: (2019)

Local limit theorems for subgraph counts
af: Sah, Ashwin, et al.
Udgivet: (2022)

Count, crop and recognise: fine-grained recognition in the wild
af: Bain, M, et al.
Udgivet: (2020)

Fine-grained reductions from approximate counting to decision
af: Dell, H, et al.
Udgivet: (2018)

Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process
af: Goldberg, LA, et al.
Udgivet: (2024)

Efficient algorithms for subgraph counting and enumeration on large graphs
af: Wang, Kaixin
Udgivet: (2024)

Threshold functions in random subgraph counting in the random-connection model
af: Chan, Luo Xi
Udgivet: (2024)

Modelling and comparing protein interaction networks using subgraph counts
af: Chegancas Rito, TM
Udgivet: (2012)

Parameterised linearizability
af: Yang, H, et al.
Udgivet: (2014)

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
af: Aliakbarpour, Maryam, et al.
Udgivet: (2018)

Assessment of model fit via network comparison methods based on subgraph counts
af: Ospina-Forero, L, et al.
Udgivet: (2018)

Fine-grained dichotomies for the Tutte Plane and Boolean #CSP
af: Brand, C, et al.
Udgivet: (2018)

Fine-grained dichotomies for the Tutte plane and Boolean #CSP
af: Roth, M, et al.
Udgivet: (2017)

Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
af: Coulson, M, et al.
Udgivet: (2018)

Poisson approximation of subgraph counts in stochastic block models and a graphon model
af: Coulson, M, et al.
Udgivet: (2016)

Fine Grained Robotics
af: Flynn, Anita M., et al.
Udgivet: (2008)

Urban intensity parameterisation
af: Noor Azzy Zulkifli
Udgivet: (2021)

Modulo-N equalizer
af: 383014 Halim Abd. Aziz
Udgivet: (1977)

Detecting and counting small subgraphs, and evaluating a parametrized Tutte Polynomial: Lower bounds via toroidal grids and Cayley graph expanders
af: Roth, M, et al.
Udgivet: (2021)

Sublinear-time algorithms for counting star subgraphs with applications to join selectivity estimation
af: Peebles, John Lee Thompson, Jr
Udgivet: (2016)

Fine−grain Concurrency
af: Hoare, T
Udgivet: (2007)

Fine−Grain Concurrency
af: Hoare, T
Udgivet: (2008)

Fine-Grained Cryptography
af: Degwekar, Akshay Dhananjai, et al.
Udgivet: (2017)

Fine-grained cryptography
af: Vasudevan, Prashant Nalini
Udgivet: (2019)

Fine−grain concurrency
af: Hoare, T
Udgivet: (2010)