Pages that link to "Item:Q3378496"
From MaRDI portal
The following pages link to Computing and Drawing Isomorphic Subgraphs (Q3378496):
Displaying 7 items.
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- VF2++ -- an improved subgraph isomorphism algorithm (Q1744243) (← links)
- Subgraphs as a Measure of Similarity (Q3064404) (← links)
- (Q4422264) (← links)
- (Q4536517) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)