92 search results - page 5 / 19 » isaac 2007 |
FGCS
2007
13 years 8 months ago
2007
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...