4926 search results - page 152 / 986 » Two Graph Algorithms On an Associative Computing Model |
147
Voted
ICSM
2005
IEEE
15 years 10 months ago
2005
IEEE
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
155
click to vote
GRID
2008
Springer
15 years 5 months ago
2008
Springer
SmartGridSolve is an extension of GridSolve that expands the single task map and client-server model of GridRPC by implementing server to server communication and the mapping of a...
139
Voted
JCT
2008
15 years 5 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
256
Voted
SPAA
2012
ACM
13 years 7 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
156
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...