Parallel algorithms for maximal acyclic sets

DOI10.1007/PL00009178zbMath0897.68052OpenAlexW2019053395MaRDI QIDQ1386369

Xin He, Zhi-Zhong Chen

Publication date: 10 August 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009178

zbMATH Keywords

EREW PRAMspanning forest problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.

This page was built for publication: Parallel algorithms for maximal acyclic sets