A dynamic programming algorithm for the maximum induced matching problem in permutation graphs
Abstract
References
Index Terms
- A dynamic programming algorithm for the maximum induced matching problem in permutation graphs
Recommendations
Quadratic time algorithm for maximum induced matching problem in trapezoid graphs
ICISS '19: Proceedings of the 2nd International Conference on Information Science and SystemsMaximum matching problem is one of the most fundamental and applicable problems in graph theory. Various algorithms to solve it are introduced from the mid-20th century. Recently, maximum induced matching problem, which is finding a matching of maximum ...
Maximum weight induced matching in some subclasses of bipartite graphs
AbstractA subset of edges of a graph is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an induced matching if G[M], the subgraph of G induced by M, is the same as G[S], the subgraph of G induced ...
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
We show that there exist linear-time algorithms that compute the strong chromatic index and a maximum induced matching of tree-cographs when the decomposition tree is a part of the input. We also show that there exist efficient algorithms for the strong ...
Comments
Information & Contributors
Information
Published In
In-Cooperation
- SOICT: School of Information and Communication Technology - HUST
- NAFOSTED: The National Foundation for Science and Technology Development
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 58Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)4
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in