A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs

Darcy Best, Max Ward

We provide an algorithm requiring only $O(N^2)$ time to compute the maximum weight independent set of interval filament graphs. This also implies an $O(N^4)$ algorithm to compute t…