2398 search results - page 230 / 480 » Constraint Programming and Graph Algorithms |
172
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
181
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
201
click to vote
TCBB
2010
15 years 1 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
198
click to vote
SOFSEM
2007
Springer
16 years 19 days ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
156
click to vote
PPDP
2005
Springer
16 years 9 hour ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...