You are here

The Join the Club Interpretation of Some Graph Algorithms

by Isaac Sonin (University of North Carolina - Charlotte) and Harold Reiter (University of North Carolina - Charlotte)

This article originally appeared in:
College Mathematics Journal
January, 1996

Subject classification(s): Discrete Mathematics | Algorithms
Applicable Course(s): 3.7 Discrete Math

Using the idea of joining a club to help students remember graph theory algorithms


A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Average: 3.1 (22 votes)

Dummy View - NOT TO BE DELETED