5889 search results - page 284 / 1178 » Graph Layout Problems |
199
click to vote
WAOA
2005
Springer
16 years 4 days ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
184
click to vote
WG
2005
Springer
16 years 4 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
179
click to vote
AUSAI
2005
Springer
16 years 4 days ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
183
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
172
click to vote
DM
2008
15 years 6 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...