A coding method for efficient subgraph querying on vertex- and edge-labeled graphs.
Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world. Unfortunately, subgraph querying is very time consuming since it involves subgraph isomorphism testing that is known to be an NP-c...
Main Authors: | Lei Zhu, Qinbao Song, Yuchen Guo, Lei Du, Xiaoyan Zhu, Guangtao Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2014-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC4031119?pdf=render |
Similar Items
-
Dynamic Top-K Interesting Subgraph Query on Large-Scale Labeled Graphs
by: Xiaohuan Shan, et al.
Published: (2019-02-01) -
Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs
by: Xiaohuan Shan, et al.
Published: (2021-01-01) -
Accurate querying of frequent subgraphs in power grid graph data
by: Aihua Zhou, et al.
Published: (2019-02-01) -
On (a,1)-Vertex-Antimagic Edge Labeling of Regular Graphs
by: Martin Bača, et al.
Published: (2015-01-01) -
Multicolored Subgraphs in an Edge-colored Graphs
by: Lo, Yuan-Hsun, et al.
Published: (2010)