3008 search results - page 402 / 602 » Independence in connected graphs |
195
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
161
click to vote
ASPDAC
2006
ACM
16 years 27 days ago
2006
ACM
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
198
click to vote
ACSD
2005
IEEE
16 years 17 days ago
2005
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed processes in digital systems. In previous work, syst...
135
click to vote
ICDCS
2003
IEEE
16 years 6 days ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
196
click to vote
COCOON
2000
Springer
15 years 11 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...