684 search results - page 17 / 137 » A characterization of b-perfect graphs |
COMBINATORICS
2006
15 years 1 months ago
2006
This paper introduces parity versions of familiar graph theoretic results, in particular results related to 2-connectedness. The even and odd circuit connected graphs are characte...
125
click to vote
SIGECOM
1999
ACM
15 years 6 months ago
1999
ACM
Performance analysis and capacity planning for e-commerce sites poses an interesting problem: how to best characterize the workload of these sites. Tradition al workload character...
DM
2008
15 years 1 months ago
2008
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
105
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
110
click to vote
AC
2003
Springer
15 years 7 months ago
2003
Springer
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determines...