707 search results - page 81 / 142 » Solving path problems on the GPU |
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...
118
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
109
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...