Sciweavers

35 search results - page 4 / 7
» Backbone colorings for graphs: Tree and path backbones
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
13 years 8 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
COCOON
2007
Springer
14 years 2 months ago
Colored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...
VTC
2008
IEEE
141views Communications» more  VTC 2008»
14 years 2 months ago
Address Assignment and Routing Schemes for ZigBee-Based Long-Thin Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) have been extensively researched recently. This paper makes two contributions to this field. First, we promote a new concept of long-thi...
Meng-Shiuan Pan, Hua-Wei Fang, Yung-Chih Liu, Yu-C...
BDA
2001
13 years 10 months ago
Rewriting and Evaluating Tree Queries with XPath
A Community Web portal is a set of tools for a community of people who want to share information on a certain domain via the Web. The backbone of this system is an ontology which ...
Bernd Amann, Catriel Beeri, Irini Fundulaki, Miche...
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 2 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar