DFS is Unsparsable and Lookahead Can Help in Maximal Matching

  • Kitti Gelle
  • Szabolcs Iván


In this paper we study two problems in the context of fully dynamic graph algorithms that is, when we have to handle updates (insertions and removals of edges), and answer queries regarding the current graph, preferably with a better time bound than that when running a classical algorithm from scratch each time a query arrives. In the first part we show that there are dense (directed) graphs having no nontrivial strong certificates for maintaining a depth-first search tree, hence the so-called sparsification technique cannot be applied effectively to this problem. In the second part, we show that a maximal matching can be maintained in an (undirected) graph with a deterministic amortized update cost of O(log m) (where m is the all-time maximum number of the edges), provided that a lookahead of length m is available, i.e. we can “take a peek” at the next m update operations in advance.
How to Cite
Gelle, K., & Iván, S. (2018). DFS is Unsparsable and Lookahead Can Help in Maximal Matching. Acta Cybernetica, 23(3), 887-902. https://doi.org/10.14232/actacyb.23.3.2018.10
Regular articles

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.