1528 search results - page 105 / 306 » On Signatures for Communication Graphs |
146
click to vote
JPDC
2008
15 years 6 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
162
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
218
click to vote
ICDCS
2008
IEEE
16 years 24 days ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
152
click to vote
HCW
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
164
click to vote
CCCG
2004
15 years 7 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...