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...

Full description

Saved in:
Bibliographic Details
Main Authors: Bhowmick, Sourav S., Cheng, James, Lin, Wenqing, Xiao, Xiaokui
Other Authors: School of Computer Engineering
Format: Conference or Workshop Item
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/97963
http://hdl.handle.net/10220/12302
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first