Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Kutner, David C."'
A simple greedy algorithm to find a maximal independent set (MIS) in a graph starts with the empty set and visits every vertex, adding it to the set if and only if none of its neighbours are already in the set. In this paper, we consider the generali
Externí odkaz:
http://arxiv.org/abs/2403.17658
The network-based study of financial systems has received considerable attention in recent years but has seldom explicitly incorporated the dynamic aspects of such systems. We consider this problem setting from the temporal point of view and introduc
Externí odkaz:
http://arxiv.org/abs/2403.02198
Autor:
Kutner, David C., Stewart, Iain A.
The Reconfigurable Routing Problem (RRP) in hybrid networks is, in short, the problem of finding settings for optical switches augmenting a static network so as to achieve optimal delivery of some given workload. The problem has previously been studi
Externí odkaz:
http://arxiv.org/abs/2401.13359
The simple greedy algorithm to find a maximal independent set of a graph can be viewed as a sequential update of a Boolean network, where the update function at each vertex is the conjunction of all the negated variables in its neighbourhood. In gene
Externí odkaz:
http://arxiv.org/abs/2307.05216
Autor:
Kutner, David C., Larios-Jones, Laura
Given a population with dynamic pairwise connections, we ask if the entire population could be (indirectly) infected by a small group of $k$ initially infected individuals. We formalise this problem as the Temporal Reachability Dominating Set (TaRDiS
Externí odkaz:
http://arxiv.org/abs/2306.06999
Autor:
Kutner, David C., Hadžidedić, Sunčica
Deafblind people have both hearing and visual impairments, which makes communication with other people often dependent on expensive technologies e.g., Braille displays, or on caregivers acting as interpreters. This paper presents Morse I/O (MIO), a v
Externí odkaz:
http://arxiv.org/abs/2205.04802