Note: The induced matching and chain subgraph cover problems for convex bipartite graphs

Authors:
Andreas Brandstädt;Elaine M. Eschen;R. Sritharan
Affiliations:
Institut für Informatik, Universität Rostock, D-18051 Rostock, Germany;Lane Department of Computer Science and Electrical Engineering, PO Box 6109, West Virginia University, Morgantown, WV 26506, USA;Computer Science Department, The University of Dayton, Dayton, OH 45469, USA
Venue:
Theoretical Computer Science
Year:
2007

Citing 8
Cited 4

Irredundancy in circular arc graphs

Discrete Applied Mathematics
On the 2-chain subgraph cover and related problems

Journal of Algorithms
On the complexity of the k-chain subgraph cover problem

Theoretical Computer Science
Graph classes: a survey

Graph classes: a survey
Weakly chordal graph algorithms via handles

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New results on induced matchings

Discrete Applied Mathematics
Finding a maximum induced matching in weakly chordal graphs

Discrete Mathematics - Special issue: The 18th British combinatorial conference
Induced matchings in asteroidal triple-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics

Dominating Induced Matchings

Graph Theory, Computational Intelligence and Thought
On the complexity of the dominating induced matching problem in hereditary classes of graphs

Discrete Applied Mathematics
Maximum induced matching problem on hhd-free graphs

Discrete Applied Mathematics
New results on maximum induced matchings in bipartite graphs and beyond

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present an O(n^2)-time algorithm for computing a maximum cardinality induced matching and a minimum cardinality cover by chain subgraphs for convex bipartite graphs. This improves the previous time bound of O(m^2).