Sciweavers

3211 search results - page 446 / 643
» On the Grundy Number of a Graph
Sort
View
ADHOCNOW
2008
Springer
15 years 7 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
ACTA
2007
92views more  ACTA 2007»
15 years 6 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
AHSWN
2010
105views more  AHSWN 2010»
15 years 6 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
15 years 6 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 6 months ago
The Dynamics of Vehicular Networks in Urban Environments
Vehicular Ad hoc NETworks (VANETs) have emerged as a platform to support intelligent inter-vehicle communication and improve traffic safety and performance. The road-constrained a...
Nicholas Loulloudes, George Pallis, Marios D. Dika...