Re: Graph theory
If I was to generalise ?
How many edges must be removed from a connected (p,q) graph to obtain a
spanning tree ?
Brendan
.
Relevant Pages
- Re: Graph Problem
... Graph G, and you are given a set of vertices. ... I think this can be done by finding shortest path between every two ... Indeed it sounds like you want a minimum spanning tree. ... that the edges have no weighting. ...
(comp.theory) - Re: finding minimum
... That is where the two functions ) intersect ... Graph the two functions, then show what curve is "m".. ... Prev by Date: ...
(sci.math) - Re: zeros graph
... > the graph. ... I can only suggest providing the suggested test program others can look ... at and see if they can reproduce the problem. ... Prev by Date: ...
(comp.soft-sys.matlab) - Re: Some Thoughts From A New Lurker
... I think it was a couple of months ago that Larry resigned under pressure and ... Brendan has had his social visit recently. ... simply not aware of these events but I don't think you can consign them to the ... Prev by Date: ...
(talk.religion.bahai) - SumProduct or Countif
... and graph the results from Column C). ... I can't figure the syntax (or maybe I should modify a SubTotal ??) ... Prev by Date: ...
(microsoft.public.excel) |
|
