6740 search results - page 334 / 1348 » An s -Hamiltonian Line Graph Problem |
142
click to vote
AUSAI
2005
Springer
15 years 9 months 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...
144
Voted
CORR
2008
Springer
15 years 4 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...
130
click to vote
DM
2008
15 years 4 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...
164
click to vote
SIAMDM
2008
15 years 4 months ago
2008
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...
122
click to vote
JGAA
2000
15 years 4 months ago
2000
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...