A faster algorithm for maximum independent set on interval filament graphs

Darcy Best, Max Ward

Research output: Contribution to journalArticlepeer-review

Abstract

We provide an algorithm requiring only O(N2) time to compute the maximum weight independent set in an N-vertex interval filament graph. This implies an O(N4)-time algorithm to compute the maximum weight induced matching in such 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(N3) and O(N6) time respectively.
Original languageEnglish
Pages (from-to)199-205
JournalJournal of Graph Algorithms and Applications
Volume26
Issue number1
DOIs
Publication statusPublished - Jun 2022
Externally publishedYes

Fingerprint

Dive into the research topics of 'A faster algorithm for maximum independent set on interval filament graphs'. Together they form a unique fingerprint.

Cite this