| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
08 February 2025 |
|
| | | |
|
Article overview
| |
|
Comments on "Stack-based Algorithms for Pattern Matching on DAGs" | Qiang Zeng
; Hai Zhuge
; | Date: |
1 Sep 2011 | Abstract: | The paper "Stack-based Algorithms for Pattern Matching on DAGs" proposes a
reachability index and stack-based algorithms to process pattern matching over
directed acyclic graphs. However, there are some fundamental problems and
imprecision in the algorithms and theorems given in that paper. In this paper,
we point out errors it has made and also make corrections in the time and space
complexities of stack-based algorithms, showing that the algorithms are
actually not as theoretically efficient as are stated in the paper. The main
results of that paper including Theorem 3.1, 3.2, 4.1 and 4.2 are disproved,
and some imprecision in particular statements and errors in some description of
algorithms are also illustrated. | Source: | arXiv, 1109.0086 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|