Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

DOI10.1006/JAGM.1993.1008MaRDI QIDQ4033763zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 4215388
• 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

Cited in

(5)

• The maximal f-dependent set problem for planar graphs is in NC
• scientific article; zbMATH DE number 6469209 (Why is no real title available?)
• A parallel algorithm for finding a triconnected component separator with an application
• A measure for the lexicographically first maximal independent set problem and its limits
• 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)