Sciweavers

367 search results - page 39 / 74
» Set connectivity problems in undirected graphs and the direc...
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Lexicographic Fairness in WDM Optical Cross-Connects
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...
Satya Ranjan Mohanty, Laxmi N. Bhuyan
TCS
1998
13 years 7 months ago
Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs
Recently a class of scalable multi-star optical networks is proposed in [2]. In this class of networks nodes are grouped into clusters. Each cluster employs a separate pair of bro...
Peng-Jun Wan
ICDCS
2007
IEEE
13 years 11 months ago
Efficient Backbone Construction Methods in MANETs Using Directional Antennas
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
Shuhui Yang, Jie Wu, Fei Dai
SIAMDM
2008
190views more  SIAMDM 2008»
13 years 7 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...
ALGORITHMICA
2011
13 years 2 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal