3211 search results - page 161 / 643 » On the Grundy Number of a Graph |
185
click to vote
ENDM
2002
15 years 6 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
206
click to vote
PROPERTYTESTING
2010
15 years 4 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
149
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this work we address the general bin-picking problem where 3D data is available. We apply Harmonic Shape Contexts (HSC) features since these are invariant to translation, scale...
173
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
214
click to vote
AB
2008
Springer
16 years 24 days ago
2008
Springer
Abstract. A well-known discrete approach to modeling biological regulatory networks is the logical framework developed by R. Thomas. The network structure is captured in an interac...