Related papers: Fully Dynamic Effective Resistances
In this paper we study dynamic averaging load balancing on general graphs. We consider infinite time and dynamic processes, where in every step new load items are assigned to randomly chosen nodes. A matching is chosen, and the load is…
Graph sketching has emerged as a powerful technique for processing massive graphs that change over time (i.e., are presented as a dynamic stream of edge updates) over the past few years, starting with the work of Ahn, Guha and McGregor…
We describe two BQP-complete problems concerning properties of sparse graphs having a certain symmetry. The graphs are specified by efficiently computable functions which output the adjacent vertices for each vertex. Let i and j be two…
Consider a sequence of i.i.d. random variables $X_n$ where each random variable is refreshed independently according to a Poisson clock. At any fixed time $t$ the law of the sequence is the same as for the sequence at time 0 but at random…
Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is…
Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and deletions of edges. Our main theoretical contribution is a…
Let $G$ be a connected graph. The resistance distance between two vertices $u$ and $v$ of $G$, denoted by $R_{G}[u,v]$, is defined as the net effective resistance between them in the electric network constructed from $G$ by replacing each…
We study well-posedness and asymptotic dynamics of a coupled system consisting of linearized 3D Navier--Stokes equations in a bounded domain and a classical (nonlinear) full von Karman shallow shell equations that accounts for both…
In this work, we study two fundamental graph optimization problems, minimum vertex cover (MVC) and maximum-cardinality matching (MCM), for intersection graphs of geometric objects, e.g., disks, rectangles, hypercubes, etc., in…
We consider the problem of maintaining a maximal independent set (MIS) in a dynamic graph subject to edge insertions and deletions. Recently, Assadi, Onak, Schieber and Solomon (STOC 2018) showed that an MIS can be maintained in sublinear…
Let $r(u,v)$ be the resistance distance between two vertices $u, v$ of a simple graph $G$, which is the effective resistance between the vertices in the corresponding electrical network constructed from $G$ by replacing each edge of $G$…
This paper is about the construction of displacement interpolations on a discrete metric graph. Our approach is based on the approximation of any optimal transport problem whose cost function is a distance on a discrete graph by a sequence…
We prove that in all regular robust expanders $G$ every edge is asymptotically equally likely contained in a uniformly chosen perfect matching $M$. We also show that given any fixed matching or spanning regular graph $N$ in $G$, the random…
We describe algorithms, based on Avis and Fukuda's reverse search paradigm, for listing all maximal independent sets in a sparse graph in polynomial time and delay per output. For bounded degree graphs, our algorithms take constant time per…
We consider the class of conditional graph patterns (\emph{CGPs}) that allow user to query data graphs with complex patterns that contain negation and predicates. To overcome the prohibitive cost of subgraph isomorphism, we consider…
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…
We generalize the technique of smoothed analysis to distributed algorithms in dynamic network models. Whereas standard smoothed analysis studies the impact of small random perturbations of input values on algorithm performance metrics,…
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also…
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or…
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…