990 search results - page 62 / 198 » Sub-Graphs of Complete Graph |
135
click to vote
FASE
2008
Springer
15 years 4 months ago
2008
Springer
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...
132
click to vote
JGT
2007
15 years 2 months ago
2007
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...
115
click to vote
COMBINATORICS
2000
15 years 2 months ago
2000
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...
124
click to vote
WG
2010
Springer
15 years 20 days ago
2010
Springer
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...
148
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
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...