Efficient and scalable labeled subgraph matching using SGMatch

@article{Rivero2016EfficientAS,
  title={Efficient and scalable labeled subgraph matching using SGMatch},
  author={Carlos R. Rivero and Hasan M. Jamil},
  journal={Knowledge and Information Systems},
  year={2016},
  volume={51},
  pages={61-87}
}
Graphs are natural candidates for modeling application domains, such as social networks, pattern recognition, citation networks, or protein–protein interactions. One of the most challenging tasks in managing graphs is subgraph matching over data graphs, which attempts to find one-to-one correspondences, called solutions, among the query and data nodes. To compute solutions, most contemporary techniques use backtracking and recursion. An open research question is whether graphs can be matched… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

2016) Stanford large network dataset collection

  • J Leskovec
  • 2016
2 Excerpts

CHOCO solver: a Java library for CSP and CP

  • C Prud’homme, Fages J-G
  • 2016
1 Excerpt

Similar Papers

Loading similar papers…