Sciweavers

1986 search results - page 100 / 398
» Path Separability of Graphs
Sort
View
EOR
2008
106views more  EOR 2008»
13 years 9 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
DM
2010
128views more  DM 2010»
13 years 9 months ago
Some remarks on the geodetic number of a graph
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
Mitre Costa Dourado, Fábio Protti, Dieter R...
ICPR
2008
IEEE
14 years 10 months ago
Multiclass spectral clustering based on discriminant analysis
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
Xi Li, Zhongfei Zhang, Yanguo Wang, Weiming Hu
ICPR
2010
IEEE
14 years 1 months ago
Face Recognition Using a Multi-Manifold Discriminant Analysis Method
—In this paper, we propose a Multi-Manifold Discriminant Analysis (MMDA) method for face feature extraction and face recognition, which is based on graph embedded learning and un...
Wankou Yang, Changyin Sun, Lei Zhang
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 1 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
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...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...