Sciweavers

534 search results - page 52 / 107
» Diameter critical graphs
Sort
View
IPPS
1998
IEEE
15 years 3 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
114
Voted
PODC
1989
ACM
15 years 3 months ago
Multiple Communication in Multi-Hop Radio Networks
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...
Reuven Bar-Yehuda, Amos Israeli
102
Voted
BROADNETS
2006
IEEE
15 years 2 months ago
On Traffic Grooming Choices for IP over WDM networks
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
Srivatsan Balasubramanian, Arun K. Somani
AAAI
2007
15 years 1 months ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
OPODIS
2008
15 years 14 days ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric