601 search results - page 103 / 121 » Edge-dominating cycles in graphs |
GD
2009
Springer
14 years 1 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
IPPS
1999
IEEE
14 years 27 days ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
ICCAD
1997
IEEE
14 years 24 days ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
ICC
2007
IEEE
14 years 14 days ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
AHS
2006
IEEE
14 years 10 days ago
2006
IEEE
Sharing Intellectual Property (IP) blocks in today's competitive market poses significant high security risks. In this paper, we present a tutorial for a watermarking approach...