Designing stimulating programming assignments for an algorithms course: a collection of exercises based on random graphs

Authors:
Michael Mitzenmacher
Affiliations:
Univ. of California, Berkeley, Berkeley,
Venue:
ACM SIGCSE Bulletin
Year:
1996

Citing 4
Cited 1

Algorithms

Algorithms
Introduction to algorithms

Introduction to algorithms
The design and analysis of algorithms

The design and analysis of algorithms
Towards modeling the performance of a fast connected components algorithm on parallel machines

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing

Cpolynomial class: an implementation of polymonials in C++

Proceedings of the eighth annual consortium on Computing in Small Colleges Rocky Mountain conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The field of random graphs contains many surprising and interesting results. Here we demonstrate how some of these results can be used to develop stimulating, open-ended exercises for courses in algorithms and data structures or graph theory. Specifically, we provide problems for algorithms that compute minimum spanning trees, connected components, maximum flows, and all-pairs shortest paths.