706 search results - page 31 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
ALGORITHMICA
2010
13 years 7 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
IOR
2008
13 years 7 months ago
2008
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...