43 search results - page 5 / 9 » Fully dynamic algorithms for chordal graphs and split graphs |
IJICT
2007
13 years 7 months ago
2007
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
AUSAI
2005
Springer
14 years 1 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...
ESA
2004
Springer
14 years 1 months 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 ...
ASUNAM
2009
IEEE
14 years 1 months ago
2009
IEEE
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...