Hi,
I am building an educational chemistry application that involves many
user interface (UI) objects that can be dragged about with the mouse.
The UI objects can group or snap together when an object's 'group
point' comes in contact with another group point of the same type.
From this
On May 12, 8:20 pm, brunotavila [EMAIL PROTECTED] wrote:
Hi people,
How to calculate the number of binary trees that are subgraphs of a
given connected, undirected, unweighted and simple (no parallel edges
nor loops) graph?
Haven't given it too much thought, but I believe the number is
Yes, you're right. It depends on the topology of the graph. Do you
have any references for the upper or lower bound? Or even an
asymptotic of form O(2^k)?
Bruno
On Tue, May 13, 2008 at 12:28 PM, Geoffrey Summerhayes
[EMAIL PROTECTED] wrote:
On May 12, 8:20 pm, brunotavila [EMAIL
