Related papers: Move Complexity of a Self-Stabilizing Algorithm fo…
The maximum independent set problem is a classic optimization problem that has also been studied quite intensively in the distributed setting. While the problem is hard to approximate in general, there are good approximation algorithms…
Optimization algorithms are unlikely to converge to strict saddle points. Proofs to that effect rely on the Center-Stable Manifold Theorem (CSMT), casting algorithms as dynamical systems: $x_{k+1} = g_k(x_k)$. In its standard form, the CSMT…
In this paper, we develop efficient exact and approximate algorithms for computing a maximum independent set in random graphs. In a random graph $G$, each pair of vertices are joined by an edge with a probability $p$, where $p$ is a…
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without external intervention in finite time.…
To predict allowable time-step size for the fully discretized nonlinear differential equations, a stability theory is developed using exact determination of an infinite perturbation series. Mathematical induction is used to determine the…
Self-stabilization for non-masking fault-tolerant distributed system has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 2-edge-connectivity and 2-vertex-connectivity…
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a graph G is defined as lim_{k --> infty}…
Given a graph $G$ and two independent sets of same size, the Independent Set Reconfiguration Problem under token sliding ask whether one can, in a step by step manner, transform the first independent set into the second one. In each step we…
Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence…
The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and…
An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching.…
For any proper polynomial map $f:C^k\longrightarrow C^k$ define the function \alpha as $$\alpha(z):=\limsup_{n\to\infty} \frac{\log^+\log^+|f^n(z)|}{n} where \log^+:=\max(\log, 0).$$ Let f=(P_1,...,P_k) be a proper polynomial map. We define…
We give an upper bound for the number of functionally independent meromorphic first integrals that a discrete dynamical system generated by an analytic map $f$ can have in a neighborhood of one of its fixed points. This bound is obtained in…
The polynomial automorphisms of the affine plane have been studied a lot: if $f$ is such an automorphism, then either $f$ preserves a rational fibration, has an uncountable centralizer and its first dynamical degree equals $1$, or $f$…
The dynamical degree of a dominant rational map $f:\mathbb{P}^N\rightarrow\mathbb{P}^N$ is the quantity $\delta(f):=\lim(\text{deg} f^n)^{1/n}$. We study the variation of dynamical degrees in 1-parameter families of maps $f_T$. We make a…
We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph changes, we are interested in knowing the change in the set of…
We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a \PTAS. For the weighted case,…
Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, and mu(G) is the size of a maximum matching. The number…
In this paper we propose a generalized model for the motion of a two-species self-driven objects ranging from a scenario of a completely random environment of particles of negligible excluded volume to a more deterministic regime of rigid…
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in D and D is an independent set, i.e. no two vertices of D are adjacent in G. Finding a minimum…