140
Voted
CIAC
2010
Springer
15 years 8 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
162
click to vote
CIAC
2010
Springer
15 years 8 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
114
click to vote
TAPSOFT
1989
Springer
15 years 8 months ago
1989
Springer
In the 1820's Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set asso...
154
click to vote
POPL
1990
ACM
15 years 8 months ago
1990
ACM
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...