Utilizing constraint satisfaction techniques for efficient graph pattern matching

DOI10.1007/978-3-540-46464-8_17MaRDI QIDQ2728862zbMATH OpenFDO

Authors Michael Rudolf

Publication date 6 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-46464-8_17

zbMATH Keywords

constraint satisfaction problemgraph matchingsubgraph homomorphism problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Recommendations

• Efficient subgraph matching using topological node feature constraints
• The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
• Efficient pattern matching on graph patterns of bounded treewidth
• Combining Two Structured Domains for Modeling Various Graph Matching Problems
• Constraint satisfaction algorithms for graph pattern matching

Cited in

(9)

• Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
• Incremental graph pattern matching
• Constraint satisfaction algorithms for graph pattern matching
• A unified framework for strengthening topological node features and its application to subgraph isomorphism detection
• Analysis of graph transformation systems: native vs translation-based techniques
• The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
• Combining Two Structured Domains for Modeling Various Graph Matching Problems
• Size-fixed group discovery via multi-constrained graph pattern matching
• Variability-based model transformation: formal foundation and application

This page was built for publication: Utilizing constraint satisfaction techniques for efficient graph pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2728862)