Sciweavers

649 search results - page 6 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
14 years 28 days ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
GBRPR
2009
Springer
14 years 2 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone
MICCAI
2008
Springer
14 years 8 months ago
Weights and Topology: A Study of the Effects of Graph Construction on 3D Image Segmentation
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
Leo Grady, Marie-Pierre Jolly
CORR
2004
Springer
122views Education» more  CORR 2004»
13 years 7 months ago
Simple Distributed Weighted Matchings
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
Jaap-Henk Hoepman