Pages that link to "Item:Q1677051"
From MaRDI portal
The following pages link to On the complexity of submap isomorphism and maximum common submap problems (Q1677051):
Displaying 6 items.
- Preface of special issue on ``Graph-based processing for pattern recognition'' (Q1677048) (← links)
- Constraints for symmetry breaking in graph representation (Q2331101) (← links)
- Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (Q2942616) (← links)
- Arbitrary Overlap Constraints in Graph Packing Problems (Q4639933) (← links)
- A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications (Q5140773) (← links)
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem (Q6665697) (← links)