1090 search results - page 42 / 218 » Priority Algorithms for Graph Optimization Problems |
MP
2010
13 years 8 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
BMCBI
2010
13 years 10 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
ICAC
2006
IEEE
14 years 4 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
CDC
2009
IEEE
14 years 3 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...