Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

DOI10.1006/JAGM.1993.1008zbMATH Open0764.68130OpenAlexW1964658425MaRDI QIDQ4033763FDOQ4033763

Authors:

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

Recommendations

• scientific article
• Algorithms for maximum independent set in convex bipartite graphs
• An optimal parallel algorithm for maximal matching
• On the number of maximal bipartite subgraphs of a graph
• Parallel maximum independent set in convex bipartite graphs

zbMATH Keywords

parallel algorithmsmaximal bipartite set

Mathematics Subject Classification ID

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

Cited In (5)

• The maximal f-dependent set problem for planar graphs is in NC
• Title not available (Why is that?)
• A measure for the lexicographically first maximal independent set problem and its limits
• A parallel algorithm for finding a triconnected component separator with an application
• The maximal \(f\)-dependent set problem for planar graphs is in NC

This page was built for publication: Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033763)