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: | , , , , , |
|---|---|
| Format: | Online |
| Language: | English |
| Published: |
Public Library of Science
2014
|
| Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4031119/ |