3204 search results - page 214 / 641 » The b-chromatic Number of a Graph |
118
click to vote
CCCG
2010
15 years 2 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
113
click to vote
UAI
2004
15 years 2 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
105
Voted
ICPR
2010
IEEE
15 years 25 days ago
2010
IEEE
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...
CORR
2010
Springer
15 years 23 days ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
79
Voted
IPL
2006
15 years 19 days ago
2006
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...