Counting Paths and Packings in Halves

Details Counting Paths and Packings in Halves Counting Paths and Packings in Halves

2009-04-20

arxiv.org/abs/0904.3093v1

Computer Science

Data Structures and Algorithms

Scientific paper

It is shown that one can count $k$-edge paths in an $n$-vertex graph and $m$-set $k$-packings on an $n$-element universe, respectively, in time ${n \choose k/2}$ and ${n \choose mk/2}$, up to a factor polynomial in $n$, $k$, and $m$; in polynomial space, the bounds hold if multiplied by $3^{k/2}$ or $5^{mk/2}$, respectively. These are implications of a more general result: given two set families on an $n$-element universe, one can count the disjoint pairs of sets in the Cartesian product of the two families with $\nO(n \ell)$ basic operations, where $\ell$ is the number of members in the two families and their subsets.

Affiliated with

Also associated with

No associations

Rating

Counting Paths and Packings in Halves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Paths and Packings in Halves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Paths and Packings in Halves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174688