Re: Another set with cardinality |Z|

From: Colin Andrew Percival (cperciva_at_sfu.ca)
Date: 09/28/04

  • Next message: David C. Ullrich: "Re: Zenkin's paper on Cantor" 
    Date: Tue, 28 Sep 2004 07:44:09 +0000 (UTC)

    In comp.theory Kent Paul Dolan <xanthian@well.com> wrote:
    > The _simplest_ definition of a tree, that it is a
    > connected, undirected graph with one fewer edges
    > than vertices [...]

    What a complicated definition. Much simpler to say that
    a tree is a strongly connected acyclic graph.

    Colin Percival

  • Next message: David C. Ullrich: "Re: Zenkin's paper on Cantor"

    Relevant Pages

    • weighted tree generation
      ... For a given undirected graph GI would like to generate all ... change to a given tree. ... is there any standard method to assign weights to an ... algorithm will yield a given tree? ...
      (comp.theory)
    • help on graph algorithms - constructing a tree with a mixed criterion
      ... undirected graph. ... to construct a tree T which minimizes the cost with the format ... minimum spanning tree (MST) in graph G, ... As constructing MST and SPT both are in complexity P, ...
      (sci.math)
    • help on constructing a tree with a mixed criterion
      ... undirected graph. ... to construct a tree T which minimizes the cost with the format ... minimum spanning tree (MST) in graph G, ... As constructing MST and SPT both are in complexity P, ...
      (comp.theory)
    • weighted tree generation
      ... For a given undirected graph GI would like to generate all possible ... rooted trees. ... dijkstra) will yield a given tree? ... but can it be proven that it will always yield the given tree?) ...
      (sci.math.research)
    • Re: Another set with cardinality |Z|
      ... In comp.theory Kent Paul Dolan wrote: ... undirected graph with one fewer edges ... What a complicated definition. ... a tree is a strongly connected acyclic graph. ...
      (sci.math)
    Loading