Article

Approximate constrained subgraph matching

Authors:

Stéphane Zampelli,

Yves Deville,

Pierre DupontAuthors Info & Claims

CP'05: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming

Pages 832 - 836

https://doi.org/10.1007/11564751_74

Published: 01 October 2005 Publication History

Abstract

Our goal is to build a declarative framework for approximate graph matching where various constraints can be stated upon the pattern graph, enabling approximate constrained subgraph matching, extending models and constraints proposed by Rudolf [1] and Valiente et al. [2]. In the present work, we propose a CSP approach for approximate subgraph matching where the potential approximation is declaratively stated in the pattern graph as mandatory/optional nodes/edges. Forbidden edges, that is edges that may not be included in the matching, can be declared on the pattern graph. We also want to declare properties between pairs of nodes in the pattern graph, such as distance properties, that can be either stated by the user, or automatically inferred by the system. In the former case, such properties can define new approximate patterns. In the latter case, these redundant constraints enhance the pruning.

References

[1]

Rudolf, M.: Utilizing constraint satisfaction techniques for efficient graph pattern matching. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 238-251. Springer, Heidelberg (2000)

Crossref

Google Scholar

[2]

Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching. Mathematical. Structures in Comp. Sci. 12(4), 403-422 (2002)

Crossref

Google Scholar

[3]

Regin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. 12th Conf. American Assoc. Artificial Intelligence, vol. 1, pp. 362-367 (1994)

Crossref

Google Scholar

[4]

van Hoeve, W.J.: The alldifferent constraint: A survey. CoRR cs.PL/0105015 (2001)

Google Scholar

[5]

Sorlin, S., Solnon, C.: A global constraint for graph isomorphism problems. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 287-302. Springer, Heidelberg (2004)

Google Scholar

[6]

Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31-42 (1976)

Crossref

Google Scholar

[7]

Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Performance evaluation of the vf graph matching algorithm. In: ICIAP, pp. 1172-1177. IEEE Computer Society, Los Alamitos (1999)

Crossref

Google Scholar

[8]

Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarcking. CoRR cs.PL/0105015 (2001)

Google Scholar

[9]

Knuth, D.E.: The Stanford GraphBase. A Platform for Combinatorial Computing. ACM Press, New York (1993)

Crossref

Google Scholar

[10]

Dooms, G.: Cp(graph): Introducing a graph computation domain in constraint programming (accepted paper). In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 211-225. Springer, Heidelberg (2005)

Google Scholar

[11]

Deville, Y., Dooms, G., Zampelli, S., Dupont, P.: Cp(graph+map) for approximate graph matching. In: 1st International Workshop on Constraint Programming Beyond Finite Integer Domains, CP 2005 (2005) (submitted paper)

Google Scholar

Cited By

View all

Zhang WChan GChan W(2022)An Efficient Alternative to Subgraph Isomorphism and Its AdvantagesProceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence10.1145/3579654.3579768(1-6)Online publication date: 23-Dec-2022
https://dl.acm.org/doi/10.1145/3579654.3579768
Chan SCheney J(2020)Flexible Graph Matching and Graph Edit Distance Using Answer Set ProgrammingPractical Aspects of Declarative Languages10.1007/978-3-030-39197-3_2(20-36)Online publication date: 20-Jan-2020
https://dl.acm.org/doi/10.1007/978-3-030-39197-3_2
Hoffmann RMcCreesh CReilly CSingh SMarkovitch S(2017)Between subgraph isomorphism and maximum common subgraphProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298023.3298136(3907-3914)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298023.3298136

Approximate constrained subgraph matching
1. Computing methodologies
2. Mathematics of computing
  1. Discrete mathematics

Recommendations

On Perfect Matching Coverings and Even Subgraph Coverings

A perfect matching covering of a graph G is a set of perfect matchings of G such that every edge of G is contained in at least one member of it. Berge conjectured that every bridgeless cubic graph admits a perfect matching covering of order at most 5 we ...
A subgraph matching algorithm based on subgraph index for knowledge graph
Abstract
The problem of subgraph matching is one fundamental issue in graph search, which is NP-Complete problem. Recently, subgraph matching has become a popular research topic in the field of knowledge graph analysis, which has a wide range of ...
Privacy-Preserving Graph Matching Query Supporting Quick Subgraph Extraction
Graph matching, as one of the most fundamental problems in graph database, has a wide range of applications. Due to the large scale of graph database and the hardness of graph matching, graph user tends to outsource the encrypted graphs to the cloud. The ...

Comments

Information & Contributors

Information

Published In

CP'05: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming

October 2005

883 pages

ISBN:9783540292388

Editor:
Peter van Beek
Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 October 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang WChan GChan W(2022)An Efficient Alternative to Subgraph Isomorphism and Its AdvantagesProceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence10.1145/3579654.3579768(1-6)Online publication date: 23-Dec-2022
https://dl.acm.org/doi/10.1145/3579654.3579768
Chan SCheney J(2020)Flexible Graph Matching and Graph Edit Distance Using Answer Set ProgrammingPractical Aspects of Declarative Languages10.1007/978-3-030-39197-3_2(20-36)Online publication date: 20-Jan-2020
https://dl.acm.org/doi/10.1007/978-3-030-39197-3_2
Hoffmann RMcCreesh CReilly CSingh SMarkovitch S(2017)Between subgraph isomorphism and maximum common subgraphProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298023.3298136(3907-3914)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298023.3298136

Abstract

References

Cited By

Recommendations

On Perfect Matching Coverings and Even Subgraph Coverings

A subgraph matching algorithm based on subgraph index for knowledge graph

Privacy-Preserving Graph Matching Query Supporting Quick Subgraph Extraction

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations