Worst case analysis of a greedy algorithm for graph thickness

Authors:
Sinichiro Kawano;Koichi Yamazaki
Affiliations:
Department of Computer Science Gunma University, 1-5-1 Tenjin-cho, Kiryu 376-8515, Gunma, Japan;Department of Computer Science Gunma University, 1-5-1 Tenjin-cho, Kiryu 376-8515, Gunma, Japan
Venue:
Information Processing Letters
Year:
2003

Citing 1
Cited 2

On heuristics for determining the thickness of a graph

Information Sciences—Informatics and Computer Science: An International Journal

A simulated annealing algorithm for determining the thickness of a graph

Information Sciences—Informatics and Computer Science: An International Journal
A simulated annealing algorithm for determining the thickness of a graph

Information Sciences: an International Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider a greedy algorithm for thickness of graphs. The greedy algorithm we consider here takes a maximum planar subgraph away from the current graph in each iteration and repeats this process until the current graph has no edge. The greedy algorithm outputs the number of iterations which is an upper bound of thickness for an input graph G = (V, E). We show that the performance ratio of the greedy algorithm is Ω (log |V|).