6437 search results - page 163 / 1288 » Parallel Algorithms for Arrangements |
113
Voted
DAM
2000
15 years 2 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
127
Voted
INFORMS
2010
15 years 1 days ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
123
Voted
COMGEO
2007
ACM
15 years 2 months ago
2007
ACM
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
179
Voted
AINA
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
110
Voted
OTM
2005
Springer
15 years 8 months ago
2005
Springer
A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Th...