2314 search results - page 37 / 463 » Minimal Partitions of a Graph |
162
Voted
TPDS
2010
15 years 3 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
135
click to vote
JCT
2006
15 years 4 months ago
2006
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
185
Voted
IEEEPACT
2002
IEEE
15 years 9 months ago
2002
IEEE
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
144
Voted
ENDM
2002
15 years 4 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
149
click to vote
GD
2007
Springer
15 years 11 months ago
2007
Springer
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...