English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A matching in a graph is a set of edges no two of which share a commonvertex. 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 ingeneral and specifically for bipartite graphs. Lozin has been proposed anO(n^3) time algorithm for this problem on the class of bipartiteStar_123,Sun_4-free graphs. In this paper we improve and generalize this resultin presenting a simple O(n) time algorithm for maximum induced matching problemin bipartite Star_123-free graphs.

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