𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Models of Greedy Algorithms for Graph Problems

✍ Scribed by Sashka Davis; Russell Impagliazzo

Publisher
Springer
Year
2007
Tongue
English
Weight
734 KB
Volume
54
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Worst case analysis of a greedy algorith
Worst case analysis of a greedy algorithm for graph thickness
✍ Sinichiro Kawano; Koichi Yamazaki πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 208 KB

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 iteratio

Analysis of greedy algorithms on graphs
Analysis of greedy algorithms on graphs with bounded degrees
✍ Nicholas C. Wormald πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 370 KB

We give a general result on the average-case performance of certain greedy algorithms. These are derived from algorithms in which the possible operations performed at each step are prioritised. This type of prioritisation has occurred in previously studied heuristics for ΓΏnding large subgraphs with