681 search results - page 27 / 137 » General Polynomial Time Decomposition Algorithms |
MMSEC
2004
ACM
15 years 6 months ago
2004
ACM
When a host image is watermarked multiple times by the same algorithm collisions can occur. This makes it difficult for an image to host multiple watermarks. But this hosting is n...
134
Voted
COR
2008
14 years 11 months ago
2008
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
101
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
121
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
173
Voted
FOCS
1997
IEEE
15 years 4 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...