4926 search results - page 3 / 986 » Two Graph Algorithms On an Associative Computing Model |
79
Voted
JGAA
2008
14 years 11 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
100
click to vote
CCGRID
2010
IEEE
14 years 9 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
82
Voted
FUIN
2006
14 years 11 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
118
Voted
BMCBI
2011
14 years 6 months ago
2011
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
DCOSS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this paper, we study the two-tiered wireless sensor network (WSN) architecture and propose the optimal cluster association algorithm for it to maximize the overall net...