A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree
type: Item
instance of: scholarly article
title: A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree
zbMATH Open document ID: 1365.05271
DOI: 10.1007/978-3-642-32589-2_10
author: Tatsuya Akutsu
published in: Mathematical Foundations of Computer Science 2012
publication date: 2012-09-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6086212
zbMATH Keywords: maximum common subgraph
zbMATH Keywords: outerplanar graph
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: 978-3-642-32589-2 10
OpenAlex ID: W192266888
description: scientific article; zbMATH DE number 6086212