Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

Parameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so to a better understanding of their true difficulties. More recently, hardness results for problems in P were achieved using reasonable complexity theoretic assumptions such as: Strong Exponential Time Hypothesis (SETH), 3SUM and All-Pairs Shortest-Paths (APSP). According to these assumptions, many graph theoretic problems do not admit truly subquadratic algorithms, nor even truly subcubic algorithms (Williams and Williams, FOCS 2010 and Abboud, Grandoni, Williams, SODA 2015). A central technique used to tackle the difficulty of the above mentioned problems is fixed-parameter algorithms for polynomial-time problems with polynomial dependency in the fixed parameter (P-FPT). This technique was introduced by Abboud, Williams and Wang in SODA 2016 and continued by Husfeldt (IPEC 2016) and Fomin et al. (SODA 2017), using the treewidth as a parameter. Applying this technique to clique-width, another important graph parameter, remained to be done. In this paper we study several graph theoretic problems for which hardness results exist such as cycle problems (triangle detection, triangle counting, girth, diameter), distance problems (diameter, eccentricities, Gromov hyperbolicity, betweenness centrality) and maximum matching. We provide hardness results and fully polynomial FPT algorithms, using clique-width and some of its upper-bounds as parameters (split-width, modular-width and $P\_4$-sparseness). We believe that our most important result is an ${\cal O}(k^4 \cdot n + m)$-time algorithm for computing a maximum matching where $k$ is either the modular-width or the $P\_4$-sparseness. The latter generalizes many algorithms that have been introduced so far for specific subclasses such as cographs, $P\_4$-lite graphs, $P\_4$-extendible graphs and $P\_4$-tidy graphs. Our algorithms are based on preprocessing methods using modular decomposition, split decomposition and primeval decomposition. Thus they can also be generalized to some graph classes with unbounded clique-width

Fast approximation of centrality and distances in hyperbolic graphs

We show that the eccentricities (and thus the centrality indices) of all vertices of a $\delta$-hyperbolic graph $G=(V,E)$ can be computed in linear time with an additive one-sided error of at most $c\delta$, i.e., after a linear time preprocessing, for every vertex $v$ of $G$ one can compute in $O(1)$ time an estimate $\hat{e}(v)$ of its eccentricity $ecc_G(v)$ such that $ecc_G(v)\leq \hat{e}(v)\leq ecc_G(v)+ c\delta$ for a small constant $c$. We prove that every $\delta$-hyperbolic graph $G$ has a shortest path tree, constructible in linear time, such that for every vertex $v$ of $G$, $ecc_G(v)\leq ecc_T(v)\leq ecc_G(v)+ c\delta$. These results are based on an interesting monotonicity property of the eccentricity function of hyperbolic graphs: the closer a vertex is to the center of $G$, the smaller its eccentricity is. We also show that the distance matrix of $G$ with an additive one-sided error of at most $c'\delta$ can be computed in $O(|V|^2\log^2|V|)$ time, where $c'< c$ is a small constant. Recent empirical studies show that many real-world graphs (including Internet application networks, web networks, collaboration networks, social networks, biological networks, and others) have small hyperbolicity. So, we analyze the performance of our algorithms for approximating centrality and distance matrix on a number of real-world networks. Our experimental results show that the obtained estimates are even better than the theoretical bounds.Comment: arXiv admin note: text overlap with arXiv:1506.01799 by other author

Cop and robber game and hyperbolicity

In this note, we prove that all cop-win graphs G in the game in which the robber and the cop move at different speeds s and s' with s'<s, are \delta-hyperbolic with \delta=O(s^2). We also show that the dependency between \delta and s is linear if s-s'=\Omega(s) and G obeys a slightly stronger condition. This solves an open question from the paper (J. Chalopin et al., Cop and robber games when the robber can hide and ride, SIAM J. Discr. Math. 25 (2011) 333-359). Since any \delta-hyperbolic graph is cop-win for s=2r and s'=r+2\delta for any r>0, this establishes a new - game-theoretical - characterization of Gromov hyperbolicity. We also show that for weakly modular graphs the dependency between \delta and s is linear for any s'<s. Using these results, we describe a simple constant-factor approximation of the hyperbolicity \delta of a graph on n vertices in O(n^2) time when the graph is given by its distance-matrix

Accelerating cycle expansions by dynamical conjugacy

Periodic orbit theory provides two important functions---the dynamical zeta function and the spectral determinant for the calculation of dynamical averages in a nonlinear system. Their cycle expansions converge rapidly when the system is uniformly hyperbolic but greatly slowed down in the presence of non-hyperbolicity. We find that the slow convergence can be associated with singularities in the natural measure. A properly designed coordinate transformation may remove these singularities and results in a dynamically conjugate system where fast convergence is restored. The technique is successfully demonstrated on several examples of one-dimensional maps and some remaining challenges are discussed

No elliptic islands for the universal area-preserving map

A renormalization approach has been used in \cite{EKW1} and \cite{EKW2} to prove the existence of a \textit{universal area-preserving map}, a map with hyperbolic orbits of all binary periods. The existence of a horseshoe, with positive Hausdorff dimension, in its domain was demonstrated in \cite{GJ1}. In this paper the coexistence problem is studied, and a computer-aided proof is given that no elliptic islands with period less than 20 exist in the domain. It is also shown that less than 1.5% of the measure of the domain consists of elliptic islands. This is proven by showing that the measure of initial conditions that escape to infinity is at least 98.5% of the measure of the domain, and we conjecture that the escaping set has full measure. This is highly unexpected, since generically it is believed that for conservative systems hyperbolicity and ellipticity coexist