356 search results - page 58 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
90
Voted
ENDM
2007
15 years 9 days ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
LATIN
2010
Springer
14 years 10 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
118
click to vote
DAC
2010
ACM
14 years 10 months ago
2010
ACM
Clock meshes are extremely effective at filtering clock skew from environmental and process variations. For this reason, clock meshes are used in most high performance designs. Ho...
114
Voted
FPGA
2010
ACM
14 years 10 months ago
2010
ACM
Metastability is a phenomenon that can cause system failures in digital circuits. It may occur whenever signals are being transmitted across asynchronous or unrelated clock domain...
97
Voted
DAM
2011
14 years 7 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...