982 search results - page 170 / 197 » Solving Steiner tree problems in graphs to optimality |
122
click to vote
FASE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Within model-driven software development, model transformation has become a key activity. It refers to a variety of operations modifying a model for various purposes such...
145
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
115
click to vote
ISCIS
2009
Springer
15 years 10 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
113
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
170
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...