Linear time maximum induced matching algorithm for trees

Authors:
Michele Zito
Affiliations:
Department of Computer Science University of Liverpool Liverpool L69 7ZF, UK
Venue:
Nordic Journal of Computing
Year:
2000

Citing 3
Cited 3

Problems and results in combinatorial analysis and graph theory

Discrete Mathematics - First Japan Conference on Graph Theory and Applications
On induced matchings

Discrete Mathematics
Maximum induced matchings in graphs

Discrete Mathematics

Induced matchings in asteroidal triple-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On Distance-3 Matchings and Induced Matchings

Graph Theory, Computational Intelligence and Thought
On distance-3 matchings and induced matchings

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A matching in a graph G is a collection of non-intersecting edges. The matching is induced if no two edges in the matching are joined by an edge in G. This paper studies the complexity of finding a largest induced matching when the input graph is a tree. We describe the first linear time algorithm for this problem.