2314 search results - page 111 / 463 » Minimal Partitions of a Graph |
103
Voted
TVLSI
2008
15 years 3 months ago
2008
Abstract--A SMART repeater is proposed for driving capacitively-coupled, global-length on-chip interconnects that alters its drive strength dynamically to match the relative bit pa...
142
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
144
Voted
JGAA
2008
15 years 3 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
126
Voted
TC
1998
15 years 3 months ago
1998
—We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvio...
134
Voted
TPDS
2002
15 years 3 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...