Conference Proceedings

Approximate constrained subgraph matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3709 LNCS 832-836
DOI: 10.1007/11564751_74
16Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Zampelli, S., Deville, Y., & Dupont, P. (2005). Approximate constrained subgraph matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 832–836). https://doi.org/10.1007/11564751_74

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free