Baswana, Gupta and Sen [FOCS'11] showed that fully dynamic maximal matching can be maintained in general graphs with logarithmic amortized update time. More specifically, starting from an empty graph on n fixed vertices, they devised a randomized algorithm for maintaining maximal matching over any sequence of t edge insertions and deletions with a total runtime of O(t log n) in expectation and O(t log n + n log 2 n) with high probability. Whether or not this runtime bound can be improved towards O(t) has remained an important open problem. Despite significant research efforts, this question has resisted numerous attempts at resolution even for basic graph families such as forests.In this paper, we resolve the question in the affirmative, by presenting a randomized algorithm for maintaining maximal matching in general graphs with constant amortized update time. The optimal runtime bound O(t) of our algorithm holds both in expectation and with high probability.As an immediate corollary, we can maintain 2-approximate vertex cover with constant amortized update time. This result is essentially the best one can hope for (under the unique games conjecture) in the context of dynamic approximate vertex cover, culminating a long line of research.Our algorithm builds on Baswana et al.'s algorithm, but is inherently different and arguably simpler. As an implication of our simplified approach, the space usage of our algorithm is linear in the (dynamic) graph size, while the space usage of Baswana et al.'s algorithm is always at least Ω(n log n).Finally, we present applications to approximate weighted matchings and to distributed networks.
A maximal matching can be maintained in fully dynamic (supporting both addition and deletion of edges) n-vertex graphs using a trivial deterministic algorithm with a worstcase update time of O(n). No deterministic algorithm that outperforms the naïve O(n) one was reported up to this date. The only progress in this direction is due to Ivković and Lloyd [14], who in 1993 devised a deterministic algorithm with an amortized update time of O((n + m) √ 2/2 ), where m is the number of edges.In this paper we show the first deterministic fully dynamic algorithm that outperforms the trivial one. Specifically, we provide a deterministic worst-case update time of O( √ m). Moreover, our algorithm maintains a matching which is in fact a 3/2-approximate maximum cardinality matching (MCM). We remark that no fully dynamic algorithm for maintaining (2 − )-approximate MCM improving upon the naïve O(n) was known prior to this work, even allowing amortized time bounds and randomization.For low arboricity graphs (e.g., planar graphs and graphs excluding fixed minors), we devise another simple deterministic algorithm with sub-logarithmic update time. Specifically, it maintains a fully dynamic maximal matching with amortized update time of O(log n/ log log n). This result addresses an open question of Onak and Rubinfeld [19].We also show a deterministic algorithm with optimal space usage of O(n + m), that for arbitrary graphs maintains a maximal matching with amortized update time of O( √ m).
Euclidean spanners are important geometric structures, having found numerous applications over the years. Cornerstone results in this area from the late 80s and early 90s state that for any ddimensional n-point Euclidean space, there exists a (1 + )-spanner with n · O( −d+1 ) edges and lightness (normalized weight) O( −2d ). 1 Surprisingly, the fundamental question of whether or not these dependencies on and d for small d can be improved has remained elusive, even for d = 2. This question naturally arises in any application of Euclidean spanners where precision is a necessity (thus is tiny). In the most extreme case is inverse polynomial in n, and then one could potentially improve the size and lightness bounds by factors that are polynomial in n.The state-of-the-art bounds n · O( −d+1 ) and O( −2d ) on the size and lightness of spanners are realized by the greedy spanner. In 2016, Filtser and Solomon [25] proved that, in low dimensional spaces, the greedy spanner is "near-optimal"; informally, their result states that the greedy spanner for dimension d is just as sparse and light as any other spanner but for dimension larger by a constant factor. Hence the question of whether the greedy spanner is truly optimal remained open to date.The contribution of this paper is two-fold.1 Introduction Background and motivationSparse spanners. Let P be a set of n points in R d , d ≥ 2, and consider the complete weighted graph G P = (P, P 2 ) induced by P , where the weight of any edge (x, y) ∈ P 2 is the Euclidean distance |xy| between its endpoints. Let H = (P, E) be a spanning subgraph of G P , with E ⊆ P 2 , where, as in G P , the weight function is given by the Euclidean distances. For any t ≥ 1, H is called a t-spanner for P if for every x, y ∈ P , the distance d G (x, y) between x and y in G is at most t|xy|; the parameter t is called the stretch of the spanner and the most basic goal is to get it down to 1 + , for arbitrarily small > 0, 1 The lightness of a spanner is the ratio of its weight and the MST weight. without using too many edges. Euclidean spanners were introduced in the pioneering SoCG'86 paper of Chew [16], who showed that O(n) edges can be achieved with stretch √ 10, and later improved the stretch bound to 2 [17]. The first Euclidean spanners with stretch 1 + , for an arbitrarily small > 0, were presented independently in the seminal works of Clarkson [18] (FOCS'87) and Keil [38] (see also [39]), which introduced the Θ-graph in R 2 and R 3 , and soon afterwards was generalized for any R d in [45,2]. The Θ-graph is a natural variant of the Yao graph, introduced by Yao [51] in 1982, where, roughly speaking, the space R d around each point p ∈ P is partitioned into cones of angle Θ each, and then edges are added between each point p ∈ P and its closest points in each of the cones centered around it. The Θ-graph is defined similarly, where, instead of connecting p to its closest point in each cone, we connect it to a point whose orthogonal projection to some fixed ray contained in the cone is closest to p....
Abstract. In edge orientations, the goal is usually to orient (direct) the edges of an undirected network (modeled by a graph) such that all outdegrees are bounded. When the network is fully dynamic, i.e., admits edge insertions and deletions, we wish to maintain such an orientation while keeping a tab on the update time. Low out-degree orientations turned out to be a surprisingly useful tool for managing networks. Brodal and Fagerberg (1999) initiated the study of the edge orientation problem in terms of the graph's arboricity, which is very natural in this context. Their solution achieves a constant out-degree and a logarithmic amortized update time for all graphs with constant arboricity, which include all planar and excluded-minor graphs. It remained an open question -first proposed by Brodal and Fagerberg, later by Erickson and others -to obtain similar bounds with worst-case update time. We address this 15 year old question by providing a simple algorithm with worst-case bounds that nearly match the previous amortized bounds. Our algorithm is based on a new approach of maintaining a combinatorial invariant, and achieves a logarithmic out-degree with logarithmic worst-case update times. This result has applications to various dynamic network problems such as maintaining a maximal matching, where we obtain logarithmic worst-case update time compared to a similar amortized update time of Neiman and Solomon (2013).
A maximal independent set (MIS) can be maintained in an evolving m-edge graph by simply recomputing it from scratch in O(m) time after each update. But can it be maintained in time sublinear in m in fully dynamic graphs?We answer this fundamental open question in the affirmative. We present a deterministic algorithm with amortized update time O(min{∆, m 3/4 }), where ∆ is a fixed bound on the maximum degree in the graph and m is the (dynamically changing) number of edges.We further present a distributed implementation of our algorithm with O(min{∆, m 3/4 }) amortized message complexity, and O(1) amortized round complexity and adjustment complexity (the number of vertices that change their output after each update). This strengthens a similar result by Censor-Hillel, Haramaty, and Karnin (PODC'16) that required an assumption of a non-adaptive oblivious adversary.
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
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.