Re: walks in graphs

From: B Loggins (breckinloggins_at_gmail.com)
Date: 12/31/04 

Date: 31 Dec 2004 15:46:57 -0800

Ack! I forgot my most important correction: A Hamiltonian Circuit is
a closed path through a graph that visits each node EXACTLY once, not
at least once.

Arrgh, I think it's time to get off the Internets and enjoy New Years
Eve.

Relevant Pages

  • Re: Is this simple scheme secure?
    ... >>enough to comment on the case of more general secrets. ... > interesting problem" can be proved using ZKP. ... > Hamiltonian circuits on a graph. ... with the property that the existence of a Hamiltonian circuit on ...
    (sci.crypt)
  • Re: excellent article on global warming
    ... Klipstein) wrote: ... and the arctic ice is below long term trend ... When I want to know what 'his' graph is I look at 'his' graph. ... The second is the correction. ...
    (sci.electronics.design)
  • Re: Ideas for course on great ideas in (theoretical) CS?
    ... > testing, graph coloring ... ... construct a graph with a Hamiltonian circuit, ... how about sorting stacks of pancakes? ... you've got a stack of N pancakes, each a different size, and you'd like the ...
    (comp.theory)
  • Re: Is this simple scheme secure?
    ... > enough to comment on the case of more general secrets. ... interesting problem" can be proved using ZKP. ... Hamiltonian circuits on a graph. ... with the property that the existence of a Hamiltonian circuit on ...
    (sci.crypt)
  • Re: Determining the type of the graph
    ... Correction - biconnected graph has no vertex such that removing the ... I imagine testing for this in the following way: ... -test the graph for connectednes by starting from one vertex and ...
    (comp.graphics.algorithms)