10608 search results - page 25 / 2122 » Complexity of O'Hara's Algorithm |
131
click to vote
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
142
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
138
click to vote
RECOMB
2007
Springer
16 years 3 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
111
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
114
click to vote
VVS
1998
IEEE
15 years 7 months ago
1998
IEEE
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...