𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On greedy algorithms for series parallel graphs

✍ Scribed by Alan J. Hoffman

Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
304 KB
Volume
40-40
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel algorithms on graphs
Parallel algorithms on graphs
✍ E. A. Ivanov πŸ“‚ Article πŸ“… 1982 πŸ› Springer US 🌐 English βš– 339 KB
Parallel algorithms for parity graphs
Parallel algorithms for parity graphs
✍ T Przytycka; D.G Corneil πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 782 KB
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