3678 search results - page 30 / 736 » On the Stable Paths Problem |
DAM
2006
13 years 10 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
TAMC
2009
Springer
14 years 4 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
COMBINATORICA
2008
13 years 10 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
SIAMSC
2011
13 years 4 months ago
2011
Abstract. Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can ...
ICPR
2004
IEEE
14 years 11 months ago
2004
IEEE
A measure of stability for a wide class of pattern recognition algorithms is introduced to cope with overfitting in classification problems. Based on this concept, constructive me...