Pages that link to "Item:Q2912710"

The following pages link to A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree (Q2912710):

Displaying 8 items.

• Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
• 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)
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
• Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions (Q3187812) (← links)
• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
• (Q5090449) (← links)
• A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications (Q5140773) (← links)