Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time

In the fully dynamic maximal independent set (MIS) problem our goal is to maintain an MIS in a given graph G while edges are inserted and deleted from the graph. The first non-trivial algorithm for this problem was presented by Assadi, Onak, Schieber, and Solomon [STOC 2018] who obtained a determini...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 370 - 381
Hlavní autori:	Chechik, Shiri, Zhang, Tianyi
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2019
Predmet:	Computer science Data structures dynamic algorithms graph algorithms Heuristic algorithms maximal independent sets Resource management Silicon Voting
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!