FVS in induced graph

9 views

Skip to first unread message

vivekk....@nitp.ac.in

unread,

Aug 7, 2024, 1:05:42 AM8/7/24

to noc24-cs1...@nptel.iitm.ac.in

Hi,

I have a question about what is happening in this video at 00:18:34 -

http://www.youtube.com/watch?v=mTRw5p1U-0Q#t=1114s.

Could you please explain the idea with an example in "If G1 does not have FVS of size <= k then G does not have FVS of size <= k?.

Thanks!

Reference Key - Key('StudentQuestionEntity', 4579142878625792, namespace='ns_noc24_cs117')

Saket Saurabh

unread,

Sep 5, 2024, 1:39:51 AM9/5/24

to Discussion forum for Parameterized Algorithms, vivekk....@nitp.ac.in

What is FVS? To intersect all cycles. If you can not intersect all cycles of smaller graph with k vertices then can you intersect cycles of the bigger graph with