Fast RNC and NC algorithms for maximal path sets

DOI10.1016/S0304-3975(97)00132-1zbMath0913.68096OpenAlexW2015387196MaRDI QIDQ1285573

Xin He, Zhi-Zhong Chen, Ryuhei Uehara

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00132-1

zbMATH Keywords

parallel algorithmsgraph algorithmsapproximation algorithmsrandomized parallel algorithmsmaximal path setsshortest common superstrings

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• A fast and simple randomized parallel algorithm for maximal matching
• A fast and efficient NC algorithm for maximal matching
• Parallel constructions of maximal path sets and applications to short superstrings
• Parallel and sequential approximation of shortest superstrings

This page was built for publication: Fast RNC and NC algorithms for maximal path sets