International audienceThe (Gromov) hyperbolicity is a topological property of a graph, which has been recently applied in several different contexts, such as the design of routing schemes, network security, computational biology, the analysis of graph algorithms, and the classification of complex networks. Computing the hyperbolicity of a graph can be very time consuming: indeed, the best available algorithm has running-time O(n^{3.69}), which is clearly prohibitive for big graphs. In this paper, we provide a new and more efficient algorithm: although its worst-case complexity is O(n^4), in practice it is much faster, allowing, for the first time, the computation of the hyperbolicity of graphs with up to 200,000 nodes. We experimentally show that our new algorithm drastically outperforms the best previously available algorithms, by analyzing a big dataset of real-world networks. Finally, we apply the new algorithm to compute the hyperbolicity of random graphs generated with the Erdös-Renyi model, the Chung-Lu model, and the Configuration Model
This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in order to capture network survivability issues where a failure may break a whole set of resources, and has been formalized as colored graphs, where a set of resources is represented by a set of edges with same color. We consider here the analogous of classical problems such as determining paths or cuts with the minimum numbers of colors or color disjoint paths. These optimization problems are much more difficult than their counterparts in classical graph theory. In particular standard relationship such as the Max Flow -Min Cut equality do not hold any longer. In this article we identify cases where these problems are polynomial, for example when the edges of a given color form a connected subgraph, and otherwise give hardness and non approximability results for these problems.
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that this problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges (where C is the grooming ratio) and where the total number of vertices has to be minimized. Using tools of graph and design theory, we optimally solve the problem for practical values and infinite congruence classes of values for a given C, and thus improve and unify all the preceding results. We disprove a conjecture of [7] saying that the minimum number of ADMs cannot be achieved with the minimum number of wavelengths, and also another conjecture of [17].
Recently, hardness results for problems in P were achieved using reasonable complexity theoretic assumptions such as the Strong Exponential Time Hypothesis. According to these assumptions, many graph theoretic problems do not admit truly subquadratic algorithms. A central technique used to tackle the difficulty of the above mentioned problems is fixed-parameter algorithms with polynomial dependency in the fixed parameter (P-FPT). Applying this technique to clique-width, an 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, distance problems and maximum matching. We give hardness results and P-FPT algorithms, using cliquewidth and some of its upper-bounds as parameters. We believe that our most important result is an O(k 4 · 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. Our algorithms are based on preprocessing methods using modular decomposition and split decomposition. Thus they can also be generalized to some graph classes with unbounded clique-width.
The shortest-path metric d of a connected graph G is δ-hyperbolic if, and only if, it satisfies d (u, v)+d(x, y) ≤ max{d(u, x)+d(v, y), d(u, y)+d(v, x)}+2δ, for every 4-tuple u, x, v, y of G. We investigate some relations between the hyperbolicity of a graph and the hyperbolicity of its atoms, that are the subgraphs resulting from the clique-decomposition invented by Tarjan [34,45]. More precisely, we prove that the maximum hyperbolicity taken over all the atoms is at least the hyperbolicity of G minus one. We also give an algorithm to slightly modify the atoms, which is at no extra cost than computing the atoms themselves, and so that the maximum hyperbolicity taken over all the resulting graphs is exactly the hyperbolicity of G. An experimental evaluation of our methodology is provided for large collaboration networks. Finally, we deduce from our theoretical results the first linear-time algorithm to compute the hyperbolicity of an outerplanar graph. , pour tout quadruplet u, x, v, y de G. Nous étudions la relation entre l'hyperbolicité d'un graphe et celle de chacun de ses atomes. Ces derniers sont les sous-graphes résultant de la décompo-sition d'un graphe par des cliques-séparatrices [34,45]. Plus précisemment, nous montrons que l'hyperbolicité d'un atome est au plus l'hyperbolicité de G moins un. Nous proposons un algorithme pour modifier les atomes de sorte que la valeur maximale de l'hyperbolicité de ces atomes modifiés soit exactement l'hyperbolicité de G. La complexité de cet algorithme est la même que celle de la décomposition du graphe par des cliques-séparatrices. Nous évaluons expériementale-ment cette méthode sur des graphes de collaborations (co-auteurs). Enfin, nous proposons un algorithme pour calculer en temps linéaire l'hyperbolicité des graphes planaires extérieurs.
The Gromov hyperbolicity is an important parameter for analyzing complex networks which expresses how the metric structure of a network looks like a tree. It is for instance used to provide bounds on the expected stretch of greedy-routing algorithms in Internet-like graphs. However, the best known theoretical algorithm computing this parameter runs in O(n 3.69) time, which is prohibitive for large-scale graphs. In this paper, we propose an algorithm for determining the hyperbolicity of graphs with tens of thousands of nodes. Its running time depends on the distribution of distances and on the actual value of the hyperbolicity. Although its worst case runtime is O(n 4), it is in practice much faster than previous proposals as observed in our experimentations. Finally, we propose a heuristic algorithm that can be used on graphs with millions of nodes. Our algorithms are all evaluated on benchmark instances.
The shortest-path metric d of a connected graph G is We show that the problem of deciding whether an unweighted graph is 1 2 -hyperbolic is subcubic equivalent to the problem of determining whether there is a chordless cycle of length 4 in a graph. An improved algorithm is also given for both problems, taking advantage of fast rectangular matrix multiplication. In the worst case it runs in O(n 3.26 ) time.
International audienceSONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a decomposition is the sum, over all graphs in the decomposition, of the number of vertices of nonzero degree in the graph. The existence of such decompositions with minimum cost, when every pair of sites employs no more than $\frac{1}{6}$ of the wavelength capacity, is determined with a finite number of possible exceptions. Indeed, when the number N of sites satisfies $N \equiv 1 \pmod{3}$, the determination is complete, and when $N \equiv 2 \pmod{3}$, the only value left undetermined is N = 17. When $N \equiv 0 \pmod{3}$, a finite number of values of N remain, the largest being N = 2580. The techniques developed rely heavily on tools from combinatorial design theory
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
334 Leonard St
Brooklyn, NY 11211
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.