A randomized NC algorithm for the maximal tree cover problem

DOI10.1016/0020-0190(91)90117-ZzbMath0743.68071MaRDI QIDQ1183479

Zhi-Zhong Chen

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

EREW PRAMmaximal tree cover problemrandomized NC algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

A simple parallel algorithm for computing the diameters of all vertices in a tree and its application

Cites Work

• Unnamed Item
• Unnamed Item
• An improved parallel algorithm for maximal matching
• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Parallel algorithms for the connected components and minimal spanning tree problems
• Parallel Depth-First Search in General Directed Graphs
• A fast and simple randomized parallel algorithm for the maximal independent set problem

This page was built for publication: A randomized NC algorithm for the maximal tree cover problem