1951 search results - page 94 / 391 » An algorithm for improving graph partitions |
129
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
Partitioning an application among software running on a microprocessor and hardware co-processors in on-chip configurable logic has been shown to improve performance and energy co...
131
click to vote
AICCSA
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
144
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
135
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
133
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...