4926 search results - page 16 / 986 » Two Graph Algorithms On an Associative Computing Model |
142
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
149
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
114
click to vote
WG
2001
Springer
15 years 8 months ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
125
click to vote
ICDAR
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
125
click to vote
HPCC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...