686 search results - page 72 / 138 » Packing Cycles in Graphs |
123
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
103
click to vote
ICCAD
2006
IEEE
16 years 9 days ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
118
click to vote
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
124
click to vote
SAC
2010
ACM
15 years 10 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
130
Voted
DAM
1998
15 years 3 months ago
1998
We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the followi...