1027 search results - page 75 / 206 » Ordered Vertex Partitioning |
130
click to vote
GD
2004
Springer
15 years 8 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
148
click to vote
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
104
click to vote
TON
2002
15 years 2 months ago
2002
In this paper, we study the impact of heterogeneous receivers on the throughput of multicast flow control and propose a new multicast flow control algorithm to optimally partition ...
147
click to vote
ICCS
2009
Springer
15 years 9 months ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...
109
click to vote
ICCD
2006
IEEE
16 years 1 days ago
2006
IEEE
This paper discusses an automated method to build scan chains at the register-transfer level (RTL) for powerconstrained at-speed testing. By analyzing a circuit at the RTL, where ...