Sciweavers

35 search results - page 6 / 7
» Backbone colorings for graphs: Tree and path backbones
Sort
View
DAM
2008
78views more  DAM 2008»
13 years 5 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
GLOBECOM
2007
IEEE
14 years 3 days ago
End-to-End Throughput-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks
— 1 Wireless mesh networks are deployed as broadband backbones to provide ubiquitous wireless access for residents and local businesses. Utilizing multiple channels has the poten...
Fei Ye, Qing Chen, Zhisheng Niu
GD
1998
Springer
13 years 10 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
MOBIHOC
2002
ACM
14 years 5 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
JCIT
2008
138views more  JCIT 2008»
13 years 5 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan