3678 search results - page 22 / 736 » On the Stable Paths Problem |
ASP
2001
Springer
14 years 2 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
SIAMSC
2011
13 years 4 months ago
2011
A scheme is presented for the numerical solution of singular integral equations on piecewise smooth curves. It relies on several techniques: reduction, Nystr¨om discretization, co...
SWAT
1998
Springer
14 years 2 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
ICDCS
2009
IEEE
14 years 7 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...