Sciweavers

4171 search results - page 590 / 835
» Choice numbers of graphs
Sort
View
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...
DM
2008
73views more  DM 2008»
15 years 6 months ago
A note on edge-graceful spectra of the square of paths
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
Tao-Ming Wang, Cheng-Chih Hsiao, Sin-Min Lee
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
15 years 6 months ago
Permutation Reconstruction from Minors
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
Mariana Raykova