Before revision: Maximum Independent Set ( MaxIS ) problem is a fundamental  problem in graph theory, which is NP-hard . Since the underlying graphs  are always changing in numerous applications, computing a MaxIS over dynamic graphs has received increasing attention in recent years.
After revision: Maximum Independent Set ( MaxIS ) problem is a fundamental NP-hard problem in graph theory, which is NP-hard . Since the underlying graphs are always changing in numerous applications, computing a MaxIS over dynamic graphs has received increasing attention in recent years.