9532 search results - page 170 / 1907 » Logic, Graphs, and Algorithms |
138
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
143
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
140
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
157
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
112
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...