Pages that link to "Item:Q1678090"
From MaRDI portal
The following pages link to On maximum common subgraph problems in series-parallel graphs (Q1678090):
Displaying 10 items.
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- Maximum series-parallel subgraph (Q2429333) (← 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)
- (Q5090449) (← links)
- A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications (Q5140773) (← links)
- Finding the maximum subsequence sum on interconnection networks (Q5421615) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph (Q6558687) (← links)