Cited By
View all- Bergami GMaggi FMontali MPeñaloza R(2021)A Tool for Computing Probabilistic Trace AlignmentsIntelligent Information Systems10.1007/978-3-030-79108-7_14(118-126)Online publication date: 15-Jun-2021
In this paper, we study a variant of reachability queries, called label-constraint reachability (LCR) queries. Specifically, given a label set S and two vertices u"1 and u"2 in a large directed graph G, we check the existence of a directed path from u"1 ...
For reversible data hiding, the histogram-based difference expansion (DE) is one family of the generic methods where secret bits are embedded into an image by DE on prediction error. However, the ratio of the count of bit 0 to that of bit 1, embedded ...
Being a fundamental graph operator, reachability query has been widely studied by the data mining community in the past decades. In a directed acyclic graph (DAG), one vertex is reachable by another if there exists a chain of directed edges connecting ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in