1951 search results - page 45 / 391 » An algorithm for improving graph partitions |
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
FAW
2009
Springer
15 years 4 months ago
2009
Springer
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...
109
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...