Sciweavers

990 search results - page 62 / 198
» Sub-Graphs of Complete Graph
Sort
View
FASE
2008
Springer
13 years 11 months ago
A Logic of Graph Constraints
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
Fernando Orejas, Hartmut Ehrig, Ulrike Prange
JGT
2007
146views more  JGT 2007»
13 years 9 months ago
Compatible circuit decompositions of 4-regular graphs
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
Herbert Fleischner, François Genest, Bill J...
COMBINATORICS
2000
82views more  COMBINATORICS 2000»
13 years 9 months ago
The Strongly Regular (40, 12, 2, 4) Graphs
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...
Edward Spence
WG
2010
Springer
13 years 7 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...
PODC
2011
ACM
12 years 12 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses