Pages that link to "Item:Q1736548"
From MaRDI portal
The following pages link to A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548):
Displayed 4 items.
- Editorial: Special issue on graph algorithms (Q1736576) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)