Pages that link to "Item:Q2248525"
From MaRDI portal
The following pages link to A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525):
Displayed 7 items.
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- Finding Largest Common Substructures of Molecules in Quadratic Time (Q2971143) (← links)
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
- Largest Weight Common Subtree Embeddings with Distance Penalties (Q5005156) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)