Worst case analysis of a greedy algorithm for graph thickness
type: Item
instance of: scholarly article
title: Worst case analysis of a greedy algorithm for graph thickness
zbMATH Open document ID: 1173.68824
DOI: 10.1016/S0020-0190(02)00432-5
author: Sinichiro Kawano
author: Koichi Yamazaki
published in: Information Processing Letters
publication date: 2009-03-23T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5530897
zbMATH Keywords: greedy algorithm
zbMATH Keywords: graph thickness
zbMATH Keywords: maximum planar subgraph
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
cites work: Q4130999
cites work: Planarizing graphs---a survey and annotated bibliography
cites work: Determining the thickness of graphs is NP-hard
cites work: The thickness of graphs: A survey
cites work: Q4382863
full work available at URL: s0020-0190(02)00432-5
OpenAlex ID: W2089032661
Recommended article: Analysis of greedy algorithms on graphs with bounded degrees
Recommended article: Q4731220
Recommended article: Worst case analysis of a graph coloring algorithm
Recommended article: Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
Recommended article: The worst-case analysis of the Garey-Johnson algorithm
Recommended article: Q2753729
Recommended article: On the typical case complexity of graph optimization
Recommended article: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
Recommended article: Q3323287
description: scientific article; zbMATH DE number 5530897