Pages that link to "Item:Q1736548"

The following pages link to A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548):

Displaying 9 items.

• Editorial: Special issue on graph algorithms (Q1736576) (← links)
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
• A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
• A branch \& cut algorithm for the maximum common edge subgraph problem (Q2840513) (← links)
• A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree (Q2912710) (← links)
• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
• (Q5005670) (← links)
• A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications (Q5140773) (← links)
• Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)