88 search results - page 5 / 18 » Cycle Covering |
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
IJAC
2010
13 years 4 months ago
2010
Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
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...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
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 ...