The fast intersection transform with applications to counting paths

Details The fast intersection transform with applications to counting paths The fast intersection transform with applications to counting paths

2008-09-15

arxiv.org/abs/0809.2489v1

Computer Science

Data Structures and Algorithms

11 pages

Scientific paper

We present an algorithm for evaluating a linear ``intersection transform'' of a function defined on the lattice of subsets of an $n$-element set. In particular, the algorithm constructs an arithmetic circuit for evaluating the transform in ``down-closure time'' relative to the support of the function and the evaluation domain. As an application, we develop an algorithm that, given as input a digraph with $n$ vertices and bounded integer weights at the edges, counts paths by weight and given length $0\leq\ell\leq n-1$ in time $O^*(\exp(n\cdot H(\ell/(2n))))$, where $H(p)=-p\log p-(1-p)\log(1-p)$, and the notation $O^*(\cdot)$ suppresses a factor polynomial in $n$.

Affiliated with

Also associated with

No associations

Rating

The fast intersection transform with applications to counting paths 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 The fast intersection transform with applications to counting paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The fast intersection transform with applications to counting paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635071