Real life networking problems

Thread View: comp.protocols.ibm

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Nelle Gobble Mon, 03 Jun 1991 20:38

#1034

Author: Nelle Gobble
Date: Mon, 03 Jun 1991 20:38

23 lines
1239 bytes

Hi,

I am writing a High School text book on the mathematics of networks.

I am looking for real networks in which there is a need to do at least
one of the following:

a.) find the SHORTEST PATH through a network
b.) find the MAXIMUM FLOW through a network
c.) connect all the nodes of a network using the least amount of
    branches (MINIMAL SPANNING TREE)
d.) use the addition of junction points to minimize the distance
    within a network (STEINER TREE).

If you can help, I would be very grateful.  Please include your name,
title, business, and address so I can site you as a reference.

Thanks a bunch,

Nelle Gobble, Graduate Student, Mathematics
G27NELLE@ETSU.BITNET
406 Car-Mol Drive
Johnson City, TN 37601

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads