Finding a maximum matching in a circular-arc graph
type: Item
instance of: scholarly article
title: Finding a maximum matching in a circular-arc graph
zbMATH Open document ID: 0768.68159
DOI: 10.1016/0020-0190(93)90117-R
author: Y. Daniel Liang
author: Chongkye Rhee
published in: Information Processing Letters
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 168861
zbMATH Keywords: interval graphs
zbMATH Keywords: maximum matching
zbMATH Keywords: circular-arc graph
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: Paths, Trees, and Flowers
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q3732972
full work available at URL: 0020-0190(93)90117-r
OpenAlex ID: W2144795927
description: scientific article; zbMATH DE number 168861