AI Chat AI Image Generator AI Video Text to Speech

A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs

10/11/2021

∙

by Darcy Best, et al.

∙

∙

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.

Darcy Best
1 publication
Max Ward
6 publications

page 1

page 2

page 3

page 4

research

∙ 03/12/2019

On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five

A hole in a graph is an induced cycle of length at least 4, and an antih...

0 Maria Chudnovsky, et al. ∙

research

∙ 01/10/2022

An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs

The Maximum Induced Matching problem asks to find the maximum k such tha...

0 Gordon Hoi, et al. ∙

research

∙ 07/18/2021

Efficient algorithms for maximum induced matching problem in permutation and trapezoid graphs

We first design an 𝒪(n^2) solution for finding a maximum induced matchin...

0 Viet Dung Nguyen, et al. ∙

research

∙ 11/08/2017

R(QPS-Serena) and R(QPS-Serenade): Two Novel Augmenting-Path Based Algorithms for Computing Approximate Maximum Weight Matching

In this addendum, we show that the switching algorithm QPS-SERENA can be...

0 Long Gong, et al. ∙

research

∙ 06/10/2019

Efficient enumeration of non-isomorphic interval graphs

Recently, Yamazaki et al. provided an algorithm that enumerates all non-...

0 Patryk Mikos, et al. ∙

research

∙ 08/11/2020

Critical sets, crowns, and local maximum independent sets

A set S⊆ V(G) is independent (or stable) if no two vertices from S are a...

0 Vadim E. Levit, et al. ∙

research

∙ 08/30/2023

Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations

This paper studies k-claw-free graphs, exploring the connection between ...

0 Parinya Chalermsook, et al. ∙