Article View: comp.protocols.ibm
Article #1034Real life networking problems
From: Nelle Gobble
Date: Mon, 03 Jun 1991 20:38
Date: Mon, 03 Jun 1991 20:38
23 lines
1239 bytes
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
Technical Details
Message-ID:
<9106041448.AA02384@lilac.berkeley.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!ucbvax!ETSU.BITNET!G27NELLEShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!ucbvax!ETSU.BITNET!G27NELLE From: G27NELLE@ETSU.BITNET (Nelle Gobble) Newsgroups: comp.protocols.ibm Subject: Real life networking problems Message-ID: <9106041448.AA02384@lilac.berkeley.edu> Date: 3 Jun 91 20:38:01 GMT Sender: daemon@ucbvax.BERKELEY.EDU Reply-To: BITNIC IBM-NETS List <IBM-NETS%BITNIC.BITNET@lilac.berkeley.edu> Distribution: world Organization: The Internet Lines: 23