Sciweavers

785 search results - page 11 / 157
» Embedding a Forest in a Graph
Sort
View
COCOA
2008
Springer
13 years 9 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
DATESO
2004
134views Database» more  DATESO 2004»
13 years 9 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
CN
2004
114views more  CN 2004»
13 years 7 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
PAMI
2010
188views more  PAMI 2010»
13 years 2 months ago
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
SIBGRAPI
2006
IEEE
14 years 1 months ago
Duality between the Watershed by Image Foresting Transform and the Fuzzy Connectedness Segmentation Approaches
This paper makes a rereading of two successful image segmentation approaches, the fuzzy connectedness (FC) and the watershed (WS) approaches, by analyzing both by means of the Ima...
Romaric Audigier, Roberto de Alencar Lotufo