1 citations · 1 across the 6 of their papers we have counts for
4 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…
Temporal Orienteering with Changing Fuel Costs
Timothée Corsini, Jessica Enright, Laura Larios-Jones +1
The problem Orienteering asks whether there exists a walk which visits a number of sites without exceeding some fuel budget. In the variant of the problem we consider, the cost of…
Families of tractable problems with respect to vertex-interval-membership width and its generalisations
Jessica Enright, Samuel D. Hand, Laura Larios-Jones +1
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…
Parameterised algorithms for temporally satisfying reconfiguration problems
Tom Davot, Jessica Enright, Laura Larios-Jones
Given a static vertex-selection problem (e.g. independent set, dominating set) on a graph, we can define a corresponding temporally satisfying reconfiguration problem on a temporal…