Related papers: Gathering in 1-Interval Connected Graphs
In this paper we consider the problem of a multi-agent system achieving a formation in the presence of misbehaving or adversarial agents. We introduce a novel continuous time resilient controller to guarantee that normally behaving agents…
Motivated by real-world applications such as the allocation of public housing, we examine the problem of assigning a group of agents to vertices (e.g., spatial locations) of a network so that the diversity level is maximized. Specifically,…
The classical house allocation problem involves assigning $n$ houses (or items) to $n$ agents according to their preferences. A key criterion in such problems is satisfying some fairness constraints such as envy-freeness. We consider a…
We study the single-message broadcast problem in dynamic radio networks. We show that the time complexity of the problem depends on the amount of stability and connectivity of the dynamic network topology and on the adaptiveness of the…
We consider large but finite systems of identical agents on the line with up to next nearest neighbor asymmetric coupling. Each agent is modelled by a linear second order differential equation, linearly coupled to up to four of its…
In this paper, we study the {\sc Dominating Set} problem in random graphs. In a random graph, each pair of vertices are joined by an edge with a probability of $p$, where $p$ is a positive constant less than $1$. We show that, given a…
We study how we can accelerate the spreading of information in temporal graphs via shifting operations; a problem that captures real-world applications varying from information flows to distribution schedules. In a temporal graph there is a…
Several algorithms in prior literature have been proposed which guarantee consensus of normally behaving agents in a network that may contain adversarially behaving agents. These algorithms guarantee that the consensus value lies within the…
Moving an autonomous agent through an unknown environment is one of the crucial problems for robotics and network analysis. Therefore, it received a lot of attention in the last decades and was analyzed in many different settings. The graph…
We study the fine-grained complexity of graph connectivity problems in unweighted undirected graphs. Recent development shows that all variants of edge connectivity problems, including single-source-single-sink, global, Steiner,…
Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure. In this work, we develop a new framework to solve any combinatorial…
Graphlet counting is an important problem as it has numerous applications in several fields, including social network analysis, biological network analysis, transaction network analysis, etc. Most of the practical networks are dynamic. A…
The determination of the computational complexity of multi-agent pathfinding on directed graphs has been an open problem for many years. For undirected graphs, solvability can be decided in polynomial time, as has been shown already in the…
This paper focuses on the multi-agent synchronization problem with an open-loop unstable leader and followers under the switching topologies. For this issue, the typical approach is intermittent communication (including a spanning tree…
Two mobile agents, starting from different nodes of an $n$-node network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds using a deterministic algorithm. In…
We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our problem, the leader and the follower each control a subset of…
In many settings, there is an organizer who would like to divide a set of agents into $k$ coalitions, and cares about the friendships within each coalition. Specifically, the organizer might want to maximize utilitarian social welfare,…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a…
In this paper we show how to combine two algorithmic techniques to obtain linear time algorithms for various optimization problems on graphs, and present a subroutine which will be useful in doing so. The first technique is iterative…