1951 search results - page 97 / 391 » An algorithm for improving graph partitions |
132
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
153
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
111
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
135
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
130
click to vote
GLVLSI
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we propose a hardware real time operating system (HW-RTOS) solution that makes use of a dedicated hardware in order to replace the standard support provided by the P...