Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
From MaRDI portal
Publication:5025046
DOI10.3233/FI-2021-2073MaRDI QIDQ5025046
Viet-Dung Nguyen, Unnamed Author, Ba Thai Pham
Publication date: 1 February 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.08480
Related Items (1)
Cites Work
- Unnamed Item
- Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16--18, 2017. Proceedings
- Trapezoid graphs and generalizations, geometry and algorithms
- Irredundancy in circular arc graphs
- Maximum induced matching of hexagonal graphs
- Recognizing graphs without asteroidal triples
- Maximum induced matchings for chordal graphs in linear time
- A linear-time algorithm for a special case of disjoint set union
- Trapezoid graphs and their coloring
- On the Ferrers dimension of a digraph
- NP-completeness of some generalizations of the maximum matching problem
- Preserving order in a forest in less than logarithmic time and linear space
- Induced matchings
- Modular decomposition and transitive orientation
- Induced matchings in asteroidal triple-free graphs
- Finding a maximum induced matching in weakly chordal graphs
- Algorithmic graph theory and perfect graphs
- Finding a maximum matching in a permutation graph
- New results on induced matchings
- Maximum induced matching algorithms via vertex ordering characterizations
- Moderately exponential time algorithms for the maximum induced matching problem
- Exact algorithms for maximum induced matching
- Independent Sets in Asteroidal Triple-Free Graphs
- On the 2-Chain Subgraph Cover and Related Problems
- Efficient maximum matching algorithms for trapezoid graphs
This page was built for publication: Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
