Sciweavers

4926 search results - page 58 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
JPDC
2008
129views more  JPDC 2008»
13 years 7 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
GD
2005
Springer
14 years 1 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
ISCAS
2003
IEEE
113views Hardware» more  ISCAS 2003»
14 years 29 days ago
Tile-graph-based power planning
In this paper, we introduce a tile-graph-based approach to power planning. For a given flooplan solution, the power inputs are modeled into a tile graph, the minimum capacity of e...
Jyh Perng Fang, Sao Jie Chen
IPPS
2005
IEEE
14 years 1 months ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...