
05303001
j
2008d.00396
Malkevitch, Joseph
Big oaks from little acorns grow.
Consortium 2007, No. 93, 1216 (2007).
2007
COMAP (Consortium for Mathematics and Its Applications), Bedford, MA
EN
K34
K35
shortest path problem
graph theory
Summary: A group of six high school students (who are mutual friends) want to set up study group pairs to work to improve their mathematical skills. The six students live at the locations $A, B,\dots,$ $F$ shown on a schematic diagram of their neighborhood. The students plan meetings at the home of one of the two members in the pair alternately. What is the best pairing?