Biblio Discovery — Demo Discovery Service

6 results for "Meeks, Kitty"

Showing 1–6 · 1.30 seconds · RSS

  1. Journal Article Full text

    Counting Temporal Paths

    Enright, Jessica; Meeks, Kitty; Molter, Hendrik

    Algorithmica · 2025 · English · PubMed Central

    This work investigates the parameterised complexity of counting temporal paths. The problem of counting temporal paths is mainly motivated by temporal betweenness computation. The betweenness centrality of a vertex v is an important centrality measure that quantifies how many optimal paths between…

  2. Preprint Full text

    Tangled Paths: A Random Graph Model from Mallows Permutations

    Enright, Jessica; Meeks, Kitty; Pettersson, William et al.

    arXiv · 2021 · English · arXiv

    We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with parameter $0

  3. Preprint Full text

    Cops and Robbers on Multi-Layer Graphs

    Enright, Jessica; Meeks, Kitty; Pettersson, William et al.

    arXiv · 2023 · English · arXiv

    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 intuition about the best way to allocate cops to layers is not always correct, and prove that the multi-layer cop number is…

  4. Preprint Full text

    A New Temporal Interpretation of Cluster Editing

    Bocci, Cristiano; Capresi, Chiara; Meeks, Kitty et al.

    arXiv · 2022 · English · arXiv

    The NP-complete graph problem Cluster Editing seeks to transform a static graph into a disjoint union of cliques by making the fewest possible edits to the edges. We introduce a natural interpretation of this problem in temporal graphs, whose edge sets change over time. This problem is NP-complete…

  5. Preprint Full text

    The complexity of finding and enumerating optimal subgraphs to represent spatial correlation

    Enright, Jessica; Lee, Duncan; Meeks, Kitty et al.

    arXiv · 2020 · English · arXiv

    Understanding spatial correlation is vital in many fields including epidemiology and social science. Lee, Meeks and Pettersson (Stat. Comput. 2021) recently demonstrated that improved inference for areal unit count data can be achieved by carrying out modifications to a graph representing spatial…

  6. Preprint Full text

    Families of tractable problems with respect to vertex-interval-membership width and its generalisations

    Enright, Jessica; Hand, Samuel D.; Larios-Jones, Laura et al.

    arXiv · 2025 · English · arXiv

    Temporal graphs are graphs whose edges are labelled with times at which they are active. Their time-sensitivity provides a useful model of real networks, but renders many problems studied on temporal graphs more computationally complex than their static counterparts. To contend with this, there has…