A linear time algorithm for the maximum matching problem on cographs
type: Item
instance of: scholarly article
title: A linear time algorithm for the maximum matching problem on cographs
zbMATH Open document ID: 0818.68090
DOI: 10.1007/BF01990526
author: Ming-Shing Yu
author: C. H. Yang
published in: BIT
publication date: 1994-03-07T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 503582
zbMATH Keywords: data structures
zbMATH Keywords: maximum matching problem
zbMATH Keywords: cographs
MaRDI profile type: Publication
cites work: A simple parallel tree contraction algorithm
cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
cites work: Complement reducible graphs
cites work: Clustering and domination in perfect graphs
cites work: Q3676177
cites work: Q5585020
description: scientific article; zbMATH DE number 503582