A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree (Q2912710)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree |
scientific article; zbMATH DE number 6086212
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree |
scientific article; zbMATH DE number 6086212 |
Statements
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree (English)
0 references
25 September 2012
0 references
maximum common subgraph
0 references
outerplanar graph
0 references
dynamic programming
0 references
