185 search results - page 3 / 37 » Solving problems on recursively constructed graphs |
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
EJC
2010
14 years 9 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
69
Voted
COLT
2001
Springer
15 years 2 months ago
2001
Springer
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...
IV
2009
IEEE
15 years 4 months ago
2009
IEEE
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
ERSHOV
1989
Springer
15 years 1 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...