A dynamic programming algorithm for the maximum induced matching problem in permutation graphs

Nguyen, Viet-Dung; Pham, Ba-Thai; Tran, Viet-Hung; Do, Phan-Thuan

doi:10.1145/3287921.3287961

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our results are far better than the best known O(mn) algorithm [21] in both graph classes. This paper is the complete version including preliminary results of our conference papers [22] and [23].…”

Section: Introductionmentioning

confidence: 99%

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

Nguyen,

Pham,

2021

Preprint

View full text Add to dashboard Cite

We first design an O(n 2 ) solution for finding a maximum induced matching in permutation graphs given their permutation models, based on a dynamic programming algorithm with the aid of the sweep line technique. With the support of the disjoint-set data structure, we improve the complexity to O(m+n). Consequently, we extend this result to give an O(m+n) algorithm for the same problem in trapezoid graphs. By combining our algorithms with the current best graph identification algorithms, we can solve the MIM problem in permutation and trapezoid graphs in linear and O(n 2 ) time, respectively. Our results are far better than the best known O(mn) algorithm for the maximum induced matching problem in both graph classes, which was proposed by Habib et al.

show abstract

Section: Introductionmentioning

confidence: 99%