Fast RNC and NC algorithms for finding a maximal set of paths with an application

DOI10.1007/3-540-61332-3_154zbMath1529.68229OpenAlexW1492122099MaRDI QIDQ6184665

Xin He, Ryuhei Uehara, Zhi-Zhong Chen

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_154

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• A fast and simple randomized parallel algorithm for maximal matching
• A note on shortest superstrings with flipping
• A fast and efficient NC algorithm for maximal matching
• NC algorithms for finding a maximal set of paths with application to compressing strings

This page was built for publication: Fast RNC and NC algorithms for finding a maximal set of paths with an application