Path querying on acyclic graphs using Boolean grammars
Graph data models are widely used in different areas of computer science such as bioinformatics, graph databases, social networks and static code analysis. One of the problems in graph data analysis is querying for specific paths. Such queries are usually performed by means of a formal grammar that...
| Autors principals: | , |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2019-10-01
|
| Col·lecció: | Труды Института системного программирования РАН |
| Matèries: | |
| Accés en línia: | https://ispranproceedings.elpub.ru/jour/article/view/1204 |