4926 search results - page 207 / 986 » Two Graph Algorithms On an Associative Computing Model |
147
click to vote
SEMWEB
2007
Springer
16 years 13 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
194
click to vote
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
182
click to vote
COR
2011
15 years 1 months ago
2011
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
189
click to vote
WAW
2007
Springer
16 years 13 days ago
2007
Springer
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
260
click to vote
ICPP
2006
IEEE
16 years 11 days ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...