Parallel maximum independent set in convex bipartite graphs
type: Item
instance of: scholarly article
title: Parallel maximum independent set in convex bipartite graphs
zbMATH Open document ID: 0875.68706
DOI: 10.1016/0020-0190(96)00131-7
author: Artur Czumaj
author: Krzysztof Diks
author: Teresa Przytycka
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 984194
zbMATH Keywords: Bipartite graphs
zbMATH Keywords: Convex graphs
zbMATH Keywords: Independent set
zbMATH Keywords: PRAM algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00131-7
OpenAlex ID: W2019881664
cites work: A simple parallel tree contraction algorithm
cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
cites work: Faster optimal parallel prefix sums and list ranking
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Testing for Equality between Maximum Matching and Minimum Node Covering
cites work: Maximum matching in a convex bipartite graph
cites work: Q4385522
cites work: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
description: scientific article; zbMATH DE number 984194