27 citations · 100 across the 27 of their papers we have counts for
8 papers · 1 filter
Approximating temporal modularity on graphs of small underlying treewidth
Vilhelm Agdur, Jessica Enright, Laura Larios-Jones +3
Modularity is a very widely used measure of the level of clustering or community structure in networks. Here we consider a recent generalisation of the definition of modularity to…
Cops and Robbers on Multi-Layer Graphs
Jessica Enright, Kitty Meeks, William Pettersson +1
We generalise the popular cops and robbers game to multi-layer graphs, where each cop and the robber are restricted to a single layer (or set of edges). We show that initial intuit…
Tangled Paths: A Random Graph Model from Mallows Permutations
Jessica Enright, Kitty Meeks, William Pettersson +1
We introduce the random graph which results from taking the union of two paths of length , where the vertices of one of the paths have been relabelled a…
Reconstructing the degree sequence of a sparse graph from a partial deck
Carla Groenland, Tom Johnston, Andrey Kupavskii +3
The deck of a graph is the multiset of cards . Myrvold (1992) showed that the degree sequence of a graph on vertices can be reconstructed from any d…
Directed branch-width: A directed analogue of tree-width
Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson
Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking wheth…
On the complexity of finding and counting solution-free sets of integers
Kitty Meeks, Andrew Treglown
Given a linear equation , a set of integers is -free if does not contain any `non-trivial' solutions to . This notion incorporates ma…
Extremal properties of flood-filling games
Kitty Meeks, Dominik K. Vu
The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied…
The parameterised complexity of counting even and odd induced subgraphs
Mark Jerrum, Kitty Meeks
We consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting t…