You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Chapter title |
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk
|
---|---|
Chapter number | 10 |
Book title |
Language and Automata Theory and Applications
|
Published by |
Springer, Cham, March 2015
|
DOI | 10.1007/978-3-319-15579-1_10 |
Book ISBNs |
978-3-31-915578-4, 978-3-31-915579-1
|
Authors |
H. K. Dai, Z. Wang, Dai, H. K., Wang, Z. |