algorithm for a graph theory problem

$Go Back$		Math Help Forum > College/University Maths Help > Discrete Math
$Reload this Page$ algorithm for a graph theory problem

$Reply$

Thread Tools

Display Modes

$Old$ 08-29-2008, 06:18 AM

dark_ink $dark_ink is offline$

Newbie

Join Date: Aug 2008

Posts: 1

Country:

Thanks: 0

Thanked 0 Times in 0 Posts

$dark_ink is on a distinguished road$

$Default$ algorithm for a graph theory problem

given a connected undirected graph with a positive weight assigned to each unordered pair of vertices and length assigned to each edge, find a connected sub graph
with X minimized, where X is

$Reply With Quote$

$Reply$

« Problem to prove "always divisible by" | 1-1 »

Thread Tools
$Show Printable Version$ Show Printable Version $Email this Page$ Email this Page
Display Modes
$Linear Mode$ Linear Mode $Hybrid Mode$ Switch to Hybrid Mode $Threaded Mode$ Switch to Threaded Mode

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is Off Trackbacks are Off Pingbacks are Off Refbacks are Off

Forum Jump

All times are GMT -7. The time now is 07:26 PM.

Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.