A Variant of the Dynamic Connectivity problem.

Правка en2, от RestingRajarshi, 2018-03-29 08:31:21

I have a dynamic connecticity problem, but with a additional constraint. The edges that can be added cannot be removed, and the edges that are being removed, cannot be added back. We initially have a graph too, so basically, the edges that are present in the initial graph can be removed, and new edges can be added, but the edges that are added later cannot be removed. they are permanant. Is there a simpler solution to this problem, than the normal fully connected dynamic connectivity problem?

P.S: can someone give me a link to any problem based on online fully dynamic connectivity.

Теги #graph, dynamic connectivity


  Rev. Язык Кто Когда Δ Комментарий
en2 Английский RestingRajarshi 2018-03-29 08:31:21 2 Tiny change: 'they are premanant. Is' -> 'they are permanant. Is'
en1 Английский RestingRajarshi 2017-10-08 12:34:36 637 Initial revision (published)