Subgraph isomorphism for biconnected outerplanar graphs in cubic time
type: Item
instance of: scholarly article
title: Subgraph isomorphism for biconnected outerplanar graphs in cubic time
zbMATH Open document ID: 0681.68090
DOI: 10.1016/0304-3975(89)90011-X
author: Andrzej Lingas
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4115995
zbMATH Keywords: subgraph isomorphism
zbMATH Keywords: outerplanar graphs
zbMATH Keywords: dynamic programming algorithm
MaRDI profile type: Publication
cites work: Q4198056
cites work: Parallel concepts in graph theory
cites work: Q3875946
cites work: Q3719847
cites work: Subtree Isomorphism in O(n5/2)
cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs
cites work: An Analysis of a Good Algorithm for the Subtree Problem
cites work: The subgraph isomorphism problem for outerplanar graphs
Wikidata QID: Q127642577
full work available at URL: 0304-3975(89)90011-x
OpenAlex ID: W2071484148
Recommended article: Q3731030
Recommended article: Subgraph Isomorphism in Planar Graphs and Related Problems
Recommended article: Q4886099
Recommended article: Efficient Suboptimal Graph Isomorphism
Recommended article: Planar Subgraph Isomorphism Revisited
Recommended article: Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs
Recommended article: Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees
Recommended article: Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
Recommended article: Q3804190
Recommended article: Graph isomorphism in quasipolynomial time [extended abstract]
description: scientific article; zbMATH DE number 4115995