Sciweavers

ICNP
1998
IEEE
13 years 8 months ago
Maximizable Routing Metrics
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...
Mohamed G. Gouda, Marco Schneider
INFOVIS
2000
IEEE
13 years 9 months ago
Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...
Ivan Herman, M. Scott Marshall, Guy Melanço...