202 search results - page 8 / 41 » Cycle Cover with Short Cycles |
SIAMCOMP
2010
13 years 2 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
HICSS
2009
IEEE
14 years 2 months ago
2009
IEEE
Manufacturing companies that are expanding their product offering to cover also lifecycle services in the customers’ facilities are facing the increasing complexity and risk to ...
WG
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Abstract { This paper presents the machine description language LISA for the generation of bitand cycle accurate models of DSP processors. Based on a behavioral operation descripti...
PDCAT
2007
Springer
14 years 1 months ago
2007
Springer
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. ...