694 search results - page 35 / 139 » Open Graphs and Computational Reasoning |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
ICCS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...