9532 search results - page 367 / 1907 » Logic, Graphs, and Algorithms |
178
click to vote
WDAG
2007
Springer
16 years 26 days ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
184
Voted
IPPS
2005
IEEE
16 years 10 days ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
217
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
189
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
167
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...