Abstract
This paper studies exact algorithms for the Maximum Induced Matching problem, in which an n-vertex graph is given and we are asked to find a set of maximum number of edges in the graph such that no pair of edges in the set have a common endpoint or are adjacent by another edge. This problem has applications in many different areas. We will give several structural properties of the problem and present an O ∗ (1.4391n)-time algorithm, which improves previous exact algorithms for this problem.
Author supplied keywords
Cite
CITATION STYLE
Xiao, M., & Tan, H. (2015). An improved exact algorithm for maximum induced matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9076, pp. 272–283). Springer Verlag. https://doi.org/10.1007/978-3-319-17142-5_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
