SEARCH-TREE SIZE ESTIMATION FOR THE SUBGRAPH ISOMORPHISM PROBLEM
This article addresses the problem of finding patterns in graphs. This is formally defined as the subgraph isomorphism problem and is one of the core problems in theoretical computer science. We consider the counting variation of this problem. The task is to count all instances of the pattern G occ...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2019-01-01
|
| Series: | Acta Electrotechnica et Informatica |
| Subjects: | |
| Online Access: | http://www.aei.tuke.sk/papers/2018/4/01_Cibej.pdf |