Efficient algorithms for generalized subgraph query processing
We study a new type of graph queries, which injectively maps its edges to paths of the graphs in a given database, where the length of each path is constrained by a given threshold specified by the weight of the corresponding matching edge. We give important applications of the new graph query and i...
| Main Authors: | , , , |
|---|---|
| Drugi avtorji: | |
| Format: | Conference Paper |
| Jezik: | English |
| Izdano: |
2013
|
| Teme: | |
| Online dostop: | https://hdl.handle.net/10356/97963 http://hdl.handle.net/10220/12302 |