One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Accesshttps://doi.org/10.1016/j.tcs.2007.04.006
Copy DOI
Export
Save
Share
Cite Journal: Theoretical Computer Science |  Publication Date: Apr 11, 2007 |
 Citations: 17 |  License type: publisher-specific-oa |
Affiliation: University of Rostock, West Virginia University, University of Dayton
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 ) .
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
