Sciweavers

2612 search results - page 16 / 523
» Switching Graphs and Their Complexity
Sort
View
SIAMDM
2008
190views more  SIAMDM 2008»
13 years 9 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 4 months ago
A Distributed Scheduling Algorithm for an Optical Switching Fabric
— Designing switching architectures for network routers and switches needs to consider limits imposed by the electronic technology, like small bandwidth×distance factors, power ...
Andrea Bianco, Elisabetta Carta, Davide Cuda, Jorg...
NCA
2006
IEEE
14 years 3 months ago
Full QoS Support with 2 VCs for Single-chip Switches
Current interconnection standards providing hardware support for quality of service (QoS) consider up to 16 virtual channels (VCs) for this purpose. However, most implementations ...
Alejandro Martínez, Francisco José A...
AINA
2005
IEEE
14 years 3 months ago
3D-VOQ Switch Design and Evaluation
Input Buffered Switches with Virtual Output Queues(VOQ) design to avoid Head-Of-Line problems, is a primary design of switches that can be scalable to very high speeds. However, t...
Ding-Jyh Tsaur, Xian-Yang Lu, Chin-Chi Wu, Woei Li...
IV
2005
IEEE
131views Visualization» more  IV 2005»
14 years 3 months ago
A Framework for Visualising Large Graphs
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
Wanchun Li, Seok-Hee Hong, Peter Eades