649 search results - page 118 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
CCCG
2007
13 years 10 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
IADIS
2008
13 years 10 months ago
2008
Time series analysis is a wide area of knowledge that studies processes in their evolution. The classical research in the area tends to find global laws underlying the behaviour o...
TIP
1998
13 years 8 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...