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...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 370 - 381
Main Authors:	Chechik, Shiri, Zhang, Tianyi
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2019
Subjects:	Computer science Data structures dynamic algorithms graph algorithms Heuristic algorithms maximal independent sets Resource management Silicon Voting
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!