71228 search results - page 314 / 14246 » Algorithms |
196
click to vote
ICALP
2004
Springer
16 years 21 days ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
197
click to vote
ICCSA
2004
Springer
16 years 21 days ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
169
click to vote
STACS
2004
Springer
16 years 20 days ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
180
click to vote
WEA
2004
Springer
16 years 20 days ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
213
click to vote
PDP
2010
IEEE
16 years 19 days ago
2010
IEEE
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...