Lookahead can help in maximal matching

Gelle, Kitti and Iván, Szabolcs: Lookahead can help in maximal matching. Conference of PhD Students in Computer Science, (11). pp. 97-100. (2018)

[img] Cikk, tanulmány, mű
cscs_2018_110-113.pdf

Download (307kB)

Abstract

In this paper we study a 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 in a better time bound than running a classical algorithm from scratch each time a query arrives. 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 “peek” the next m update operations in advance.

Item Type: Article
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Journal or Publication Title: Conference of PhD Students in Computer Science
Date: 2018
Volume: 11
Page Range: pp. 97-100
Uncontrolled Keywords: Számítástechnika, Algoritmus, Gráf
Additional Information: Bibliogr.: 100. p. ; összefoglalás angol nyelven
Date Deposited: 2019. Nov. 04. 10:10
Last Modified: 2019. Nov. 04. 10:10
URI: http://acta.bibl.u-szeged.hu/id/eprint/61776

Actions (login required)

View Item View Item