Connected searching of weighted trees

Details Connected searching of weighted trees Connected searching of weighted trees

2010-01-25

arxiv.org/abs/1001.4341v1

Theoretical Computer Science 412 (2011) 5700-5713

Computer Science

Data Structures and Algorithms

Scientific paper

10.1016/j.tcs.2011.06.017

In this paper we consider the problem of connected edge searching of weighted
trees. It is shown that there exists a polynomial-time algorithm for finding
optimal connected search strategy for bounded degree trees with arbitrary
weights on the edges and vertices of the tree. The problem is NP-complete for
general node-weighted trees (the weight of each edge is 1).

Affiliated with

Also associated with

No associations

Rating

Connected searching of weighted trees 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 Connected searching of weighted trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connected searching of weighted trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-130417