Sciweavers

2503 search results - page 166 / 501
» A study of 3-arc graphs
Sort
View
SIAMDM
2008
190views more  SIAMDM 2008»
15 years 6 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...
IM
2007
15 years 6 months ago
Infinite Limits and Adjacency Properties of a Generalized Copying Model
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
Anthony Bonato, Jeannette C. M. Janssen
SAC
2002
ACM
15 years 6 months ago
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
Christopher L. Barrett, Madhav V. Marathe, James P...
WG
2010
Springer
15 years 4 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
CPC
2011
219views Education» more  CPC 2011»
15 years 1 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson