Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

DOI10.1006/jagm.1993.1008zbMath0764.68130OpenAlexW1964658425MaRDI QIDQ4033763

No author found.

Publication date: 16 May 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/7064

zbMATH Keywords

parallel algorithmsmaximal bipartite set

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items

A parallel algorithm for finding a triconnected component separator with an application ⋮ The maximal f-dependent set problem for planar graphs is in NC ⋮ The maximal \(f\)-dependent set problem for planar graphs is in NC ⋮ A MEASURE FOR THE LEXICOGRAPHICALLY FIRST MAXIMAL INDEPENDENT SET PROBLEM AND ITS LIMITS