Sciweavers

2398 search results - page 78 / 480
» Constraint Programming and Graph Algorithms
Sort
View
CSCLP
2006
Springer
15 years 8 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
PPOPP
2009
ACM
16 years 5 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
CSCLP
2007
Springer
15 years 11 months ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
ICALP
1994
Springer
15 years 8 months ago
Finding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
Raphael Yuster, Uri Zwick
CSCLP
2005
Springer
15 years 10 months ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels