774 search results - page 69 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
GD
1998
Springer
14 years 1 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
ATAL
2006
Springer
14 years 25 days ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
PPOPP
2010
ACM
14 years 6 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
SIGSOFT
2003
ACM
14 years 9 months ago
2003
ACM
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...