Subgraph Queries by Context-free Grammars
We describe a method for querying vertex- and edge-labeled graphs using context-free grammars to specify the class of interesting paths. We introduce a novel problem, finding the connection subgraph induced by the set of matching paths between given two vertices or two sets of vertices. Such a subgr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2008-06-01
|
| Series: | Journal of Integrative Bioinformatics |
| Online Access: | https://doi.org/10.1515/jib-2008-100 |