6740 search results - page 400 / 1348 » An s -Hamiltonian Line Graph Problem |
177
click to vote
ESA
1999
Springer
15 years 11 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
153
click to vote
ICASSP
2007
IEEE
15 years 10 months ago
2007
IEEE
Thanks to a specific formalism for signal generation, it is possible to transpose an image processing problem to an array processing problem. For straight line characterization, t...
180
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
160
click to vote
ISCAS
1994
IEEE
15 years 11 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
167
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...