Partitioning a graph into path components
- From: garrettbaird2@xxxxxxxxxxx
- Date: 17 Aug 2005 15:58:53 -0700
Hello,
I am unable to find a graceful solution to this problem. Does anybody
have any thoughts? I have a complete directed graph on n vertices and
I would like to find how many different ways I can partition this graph
into path components not exceeding a certain length k.
Thanks!
GB
.
- Prev by Date: Re: infinity
- Next by Date: Re: help polylogarithm
- Previous by thread: x1x2x3 + x1x2x4 + x1x3x4 + x2x3x4 <= C(x1^2 + x2^2 + x3^3 + x4^2)^{3/2}
- Next by thread: linear interpolation of a log-time sequence
- Index(es):
