54 search results - page 5 / 11 » A Fully Dynamic Graph Algorithm for Recognizing Interval Gra... |
AUSAI
2005
Springer
14 years 28 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...
ESA
2004
Springer
14 years 25 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
ICDAR
2003
IEEE
14 years 22 days ago
2003
IEEE
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
IJMC
2006
13 years 7 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
ISPA
2004
Springer
14 years 25 days ago
2004
Springer
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...