434 search results - page 27 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
122
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
167
click to vote
COMPSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
147
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
116
click to vote
EURODAC
1994
IEEE
15 years 8 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
128
Voted
DIAGRAMS
2006
Springer
15 years 7 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...