1594 search results - page 46 / 319 » An Algorithm to Compute Collusion Paths |
WG
1997
Springer
15 years 3 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
IMR
2004
Springer
15 years 5 months ago
2004
Springer
We propose a new two-dimensional meshing algorithm called PINW able to generate meshes that accurately approximate the distance between any two domain points by paths composed onl...
WG
2009
Springer
15 years 6 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
ACISP
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
116
click to vote
PEWASUN
2006
ACM
15 years 5 months ago
2006
ACM
In wireless network planning, much effort is spent on the improvement of the network and transport layer – especially for Mobile Ad Hoc Networks. Although in principle realworl...