684 search results - page 33 / 137 » A characterization of b-perfect graphs |
122
click to vote
WG
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
124
Voted
IPL
2002
15 years 1 months ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
129
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
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...
105
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
—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...
129
click to vote
COLOGNETWENTE
2007
15 years 3 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...