A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:TABLQLWIrecord.jsonopen to challenge →
classification
cs.DS
cs.DM
keywords
maximumweightalgorithmfilamentgraphsindependentintervalcompute
read the original abstract
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 the maximum weight induced matching of interval filament graphs. Both algorithms significantly improve upon the previous best complexities for these problems. Previously, the maximum weight independent set and maximum weight induced matching problems required $O(N^3)$ and $O(N^6)$ time respectively.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.