Re: Graph theory problem

"Rij" <rij.ghosh@xxxxxxxxx> writes:

Let G have even no. of nodes. I want to eventually merge all nodes into
1. At each step, I will merge any two nodes. The cost of each merge is
the weight
of the edge common to the two vertices. The cost at each step is the
sum of the cost of all such merges. I want to minimize the cost over
all the steps.
Does this sound like any common graph theoretic problem?

Sounds like minimum spanning tree.

--
Falk
.

Relevant Pages

  • Graph theory problem
    ... of the edge common to the two vertices. ... The cost at each step is the ... Does this sound like any common graph theoretic problem? ... life easy. ...
    (comp.theory)
  • Re: Griffin Calls STS, ISS "Mistakes"
    ... >>the weight and cost advantages of a disposable tank. ... (OTOH, if you used tripropellant engines in the orbiter, you ... >Drop tanks will be ar cheaper to design and build than even the most ...
    (sci.space.policy)
  • Re: Cessna BRS
    ... airframe capable of a 1320 lbs gross weight. ... The CT is the kind of competition Cessna has to go up against. ... I thought about a BRS in the Zenith I'm building. ... Repacking cost is not an "unknown" or particularly hard to find ...
    (rec.aviation.homebuilt)
  • Re: Traveling salesman, idea, easy to program?
    ... B is the same cost as B to A. ... Traveling Salesman is about *cost* of travel between the cities, ... Distance is in actuality one weight that is always there, ...
    (comp.lang.java.programmer)
  • Re: Sunday Mercury Comps c/d Midday September 1,2005
    ... WIN YOUR WEIGHT IN BEER ... > 'Waggle Dance Mercury' in the subject box. ... > number,house number postcode.Texts cost 25p ...
    (uk.rec.competitions)