1133 search results - page 84 / 227 » Basics of Graph Cuts |
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
101
click to vote
WAIM
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal ...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
137
click to vote
WG
2010
Springer
14 years 8 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
159
click to vote
AGTIVE
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. The DRAGOS database eases the development of graphbased applications by providing a uniform graph-oriented data storage facility. In this paper, we extend the existing da...