A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
type: Item
instance of: scholarly article
title: A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
zbMATH Open document ID: 0688.68032
DOI: 10.1016/0020-0190(89)90044-6
author: John Ellis
author: Manrique Mata
author: Gary MacGillivray
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4128378
zbMATH Keywords: longest path outerplanar graph algorithm
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90044-6
OpenAlex ID: W2059355023
cites work: Q4065051
cites work: Q4134001
cites work: Q4190666
cites work: Q4198056
cites work: Parallel concepts in graph theory
cites work: Linear-time computability of combinatorial problems on series-parallel graphs
cites work: Q3758847
description: scientific article; zbMATH DE number 4128378