Papers

Topics

Authors

Recent

View all

Assistant

AI Research Assistant

Well-researched responses based on relevant abstracts and paper content.

Custom Instructions Pro

Preferences or requirements that you'd like Emergent Mind to consider when generating responses.

Gemini 2.5 Flash

Gemini 2.5 Flash 150 tok/s

Gemini 2.5 Pro 47 tok/s Pro

GPT-5 Medium 33 tok/s Pro

GPT-5 High 34 tok/s Pro

GPT-4o 113 tok/s Pro

Kimi K2 211 tok/s Pro

GPT OSS 120B 444 tok/s Pro

Claude Sonnet 4.5 37 tok/s Pro

2000 character limit reached

An O(n) Time Algorithm For Maximum Induced Matching In Bipartite Star_123-free Graphs (1404.6288v1)

Published 24 Apr 2014 in cs.DM

Abstract: A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-hard in general and specifically for bipartite graphs. Lozin has been proposed an O(n³⁾ time algorithm for this problem on the class of bipartite Star_123,Sun_4-free graphs. In this paper we improve and generalize this result in presenting a simple O(n) time algorithm for maximum induced matching problem in bipartite Star_123-free graphs.

Citations (1)

View on Semantic Scholar